scholarly journals MIP* = RE

2021 ◽  
Vol 64 (11) ◽  
pp. 131-138
Author(s):  
Zhengfeng Ji ◽  
Anand Natarajan ◽  
Thomas Vidick ◽  
John Wright ◽  
Henry Yuen
Keyword(s):  
Operator Algebras ◽  
Foundations Of Quantum Mechanics ◽  
Research Community ◽  
Hardness Of Approximation ◽  
Surprising Result ◽  
Open Problems ◽  
Recursively Enumerable ◽  
Pcp Theorem ◽  
Efficient Verification ◽  
Probabilistic Polynomial Time

Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in Communications is usually peer-reviewed prior to publication. The following paper is unusual in that it is still under review. However, the result has generated enormous excitement in the research community, and came strongly nominated by SIGACT, a nomination seconded by external reviewers. The complexity class NP characterizes the collection of computational problems that have efficiently verifiable solutions. With the goal of classifying computational problems that seem to lie beyond NP, starting in the 1980s complexity theorists have considered extensions of the notion of efficient verification that allow for the use of randomness (the class MA), interaction (the class IP), and the possibility to interact with multiple proofs, or provers (the class MIP). The study of these extensions led to the celebrated PCP theorem and its applications to hardness of approximation and the design of cryptographic protocols. In this work, we study a fourth modification to the notion of efficient verification that originates in the study of quantum entanglement. We prove the surprising result that every problem that is recursively enumerable, including the Halting problem, can be efficiently verified by a classical probabilistic polynomial-time verifier interacting with two all-powerful but noncommunicating provers sharing entanglement. The result resolves long-standing open problems in the foundations of quantum mechanics (Tsirelson's problem) and operator algebras (Connes' embedding problem).

PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS

2011 ◽  
Vol 22 (01) ◽  
pp. 203-212 ◽  
Author(s):  
ERZSÉBET CSUHAJ-VARJÚ ◽  
MARION OSWALD ◽  
GYÖRGY VASZIL
Keyword(s):  
Future Research ◽  
Open Problems ◽  
Recursively Enumerable Language ◽  
Recursively Enumerable ◽  
Enumerable Language ◽  
Grammar Systems ◽  
Context Free

We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the query is not precisely identified. We prove that if the same component replies to all queries issued to a cluster in a rewriting step, then non-returning PC grammar systems with 3 clusters and 7 context-free components are able to generate any recursively enumerable language. We also provide open problems and directions for future research.

COMPUTING WITH MEMBRANES (P SYSTEMS): A VARIANT

2000 ◽  
Vol 11 (01) ◽  
pp. 167-181 ◽  
Author(s):  
GHEORGHE PĂUN
Keyword(s):  
Membrane Computing ◽  
P Systems ◽  
Open Problems ◽  
Recursively Enumerable ◽  
Pass Through ◽  
The One ◽  
Priority Relation ◽  
Recursively Enumerable Languages ◽  
Biochemical Features ◽  
Computing Models

Membrane Computing is a recently introduced area of Molecular Computing, where a computation takes place in a membrane structure where multisets of objects evolve according to given rules (they can also pass through membranes). The obtained computing models were called P systems. In basic variants of P systems, the use of objects evolution rules is regulated by a given priority relation; moreover, each membrane has a label and one can send objects to precise membranes, identified by their labels. We propose here a variant where we get rid of both there rather artificial (non-biochemical) features. Instead, we add to membranes and to objects an "electrical charge" and the objects are passed through membranes according to their charge. We prove that such systems are able to characterize the one-letter recursively enumerable languages (equivalently, the recursively enumerable sets of natural numbers), providing that an extra feature is considered: the membranes can be made thicker or thinner (also dissolved) and the communication through a membrane is possible only when its thickness is equal to 1. Several open problems are formulated.

scholarly journals Large Irredundant Sets in Operator Algebras

2019 ◽  
Vol 72 (4) ◽  
pp. 988-1023
Author(s):  
Clayton Suguio Hida ◽  
Piotr Koszmider
Keyword(s):  
Von Neumann Algebras ◽  
Operator Algebras ◽  
Continuum Hypothesis ◽  
The Other ◽  
Open Problems ◽  
Von Neumann ◽  
C Algebra ◽  
Infinite Dimensional ◽  
C Algebras ◽  
The Continuum

AbstractA subset ${\mathcal{X}}$ of a C*-algebra ${\mathcal{A}}$ is called irredundant if no $A\in {\mathcal{X}}$ belongs to the C*-subalgebra of ${\mathcal{A}}$ generated by ${\mathcal{X}}\setminus \{A\}$. Separable C*-algebras cannot have uncountable irredundant sets and all members of many classes of nonseparable C*-algebras, e.g., infinite dimensional von Neumann algebras have irredundant sets of cardinality continuum.There exists a considerable literature showing that the question whether every AF commutative nonseparable C*-algebra has an uncountable irredundant set is sensitive to additional set-theoretic axioms, and we investigate here the noncommutative case.Assuming $\diamondsuit$ (an additional axiom stronger than the continuum hypothesis), we prove that there is an AF C*-subalgebra of ${\mathcal{B}}(\ell _{2})$ of density $2^{\unicode[STIX]{x1D714}}=\unicode[STIX]{x1D714}_{1}$ with no nonseparable commutative C*-subalgebra and with no uncountable irredundant set. On the other hand we also prove that it is consistent that every discrete collection of operators in ${\mathcal{B}}(\ell _{2})$ of cardinality continuum contains an irredundant subcollection of cardinality continuum.Other partial results and more open problems are presented.

Complementation in the Turing degrees

1989 ◽  
Vol 54 (1) ◽  
pp. 160-176 ◽  
Author(s):  
Theodore A. Slaman ◽  
John R. Steel
Keyword(s):  
Turing Degrees ◽  
Open Problems ◽  
Recursively Enumerable

AbstractPosner [6] has shown, by a nonuniform proof, that every degree has a complement below 0′. We show that a 1-generic complement for each set of degree between 0 and 0′ can be found uniformly. Moreover, the methods just as easily can be used to produce a complement whose jump has the degree of any real recursively enumerable in and above ∅′. In the second half of the paper, we show that the complementation of the degrees below 0′ does not extend to all recursively enumerable degrees. Namely, there is a pair of recursively enumerable degrees a above b such that no degree strictly below a joins b above a. (This result is independently due to S. B. Cooper.) We end with some open problems.

scholarly journals From quantum foundations to applications and back

2018 ◽  
Vol 376 (2123) ◽  
pp. 20170326 ◽  
Author(s):  
Nicolas Gisin ◽  
Florian Fröwis
Keyword(s):  
Quantum Information ◽  
Quantum Physics ◽  
Information Science ◽  
Quantum Information Processing ◽  
Measurement Problem ◽  
Foundations Of Quantum Mechanics ◽  
Applied Physics ◽  
Open Problems ◽  
Quantum Non Locality ◽  
Non Locality

Quantum non-locality has been an extremely fruitful subject of research, leading the scientific revolution towards quantum information science, in particular, to device-independent quantum information processing. We argue that the time is ripe to work on another basic problem in the foundations of quantum physics, the quantum measurement problem, which should produce good physics in theoretical, mathematical, experimental and applied physics. We briefly review how quantum non-locality contributed to physics (including some outstanding open problems) and suggest ways in which questions around macroscopic quantumness could equally contribute to all aspects of physics. This article is part of a discussion meeting issue ‘Foundations of quantum mechanics and their impact on contemporary society’.

PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS

2000 ◽  
Vol 11 (04) ◽  
pp. 631-650 ◽  
Author(s):  
ERZSÉBET CSUHAJ-VARJÚ ◽  
CARLOS MARTÍN-VIDE ◽  
VICTOR MITRANA ◽  
GYÖRGY VASZIL
Keyword(s):  
System Theory ◽  
Communication Strategy ◽  
Computational Power ◽  
Open Problems ◽  
Number Of Components ◽  
Grammar System ◽  
Bounded Number ◽  
Recursively Enumerable ◽  
Pushdown Automata ◽  
Recursively Enumerable Languages

We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized parallel communicating pushdown automata systems with a bounded number of components, where each automaton is allowed to issue a query, are able to recognize all recursively enumerable languages. We also present homomorphical characterizations of the class of recursively enumerable languages for the centralized variants, where only a distinguished automaton issues queries. Moreover, we show that these centralized variants are at least as powerful as one-way multihead pushdown automata. Finally, some open problems and further directions of research are discussed.

Lambda theories allowing terms with a finite number of fixed points

2015 ◽  
Vol 27 (3) ◽  
pp. 405-427
Author(s):  
BENEDETTO INTRIGILA ◽  
RICHARD STATMAN
Keyword(s):  
Finite Number ◽  
Fixed Points ◽  
Related Question ◽  
Natural Question ◽  
Open Problems ◽  
Complete Answer ◽  
Recursively Enumerable

A natural question in the λ-calculus asks what is the possible number of fixed points of a combinator (closed term). A complete answer to this question is still missing (Problem 25 of TLCA Open Problems List) and we investigate the related question about the number of fixed points of a combinator in λ-theories. We show the existence of a recursively enumerable lambda theory where the number is always one or infinite. We also show that there are λ-theories such that some terms have only two fixed points. In a first example, this is obtained by means of a non-constructive (more precisely non-r.e.) λ-theory where the range property is violated. A second, more complex example of a non-r.e. λ-theory (with a higher unsolvability degree) shows that some terms can have only two fixed points while the range property holds for every term.

ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS

1999 ◽  
Vol 10 (01) ◽  
pp. 61-79 ◽  
Author(s):  
JÜRGEN DASSOW ◽  
HENNING FERNAU ◽  
GHEORGHE PĂUN
Keyword(s):  
Systematic Study ◽  
Regular Language ◽  
Formal Languages ◽  
Open Problems ◽  
Recursively Enumerable ◽  
Leftmost Derivation ◽  
Context Free ◽  
Recursively Enumerable Languages ◽  
Context Free Grammars

Matrix grammars are one of the classical topics of formal languages, more specifically, regulated rewriting. Although this type of control on the work of context-free grammars is one of the earliest, matrix grammars still raise interesting questions (not to speak about old open problems in this area). One such class of problems concerns the leftmost derivation (in grammars without appearance checking). The main point of this paper is the systematic study of all possibilities of defining leftmost derivation in matrix grammars. Twelve types of such a restriction are defined, only four of which being discussed in literature. For seven of them, we find a proof of a characterization of recursively enumerable languages (by matrix grammars with arbitrary context-free rules but without appearance checking). Other three cases characterize the recursively enumerable languages modulo a morphism and an intersection with a regular language. In this way, we solve nearly all problems listed as open on page 67 of the monograph [7], which can be seen as the main contribution of this paper. Moreover, we find a characterization of the recursively enumerable languages for matrix grammars with the leftmost restriction defined on classes of a given partition of the nonterminal alphabet.

PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES

2002 ◽  
Vol 13 (05) ◽  
pp. 733-749 ◽  
Author(s):  
CARLOS MARTÍN-VIDE ◽  
ALEXANDRU MATEESCU ◽  
VICTOR MITRANA
Keyword(s):  
Finite Automata ◽  
Point Of View ◽  
Computational Power ◽  
Open Problems ◽  
Context Sensitive ◽  
Recursively Enumerable ◽  
Power Point ◽  
Grammar Systems ◽  
Recursively Enumerable Languages ◽  
Parallel Communicating Grammar Systems

An accepting device based on the communication between finite automata working in parallel is introduced. It consists of several finite automata working independently but communicating states to each other by request. Several variants of parallel communicating finite automata systems are investigated from their computational power point of view. We prove that all of them are at most as powerful as multi-head finite automata. Homomorphical characterizations of recursively enumerable languages are obtained starting from languages recognized by all variants of parallel communicating finite automata systems having at most three components. We present a brief comparison with the parallel communicating grammar systems. Some remarks suggesting that these devices might be mildly context-sensitive ones as well as a few open problems and directions for further research are also discussed.

Sign in / Sign up

Export Citation Format

Share Document