Related papers: Undecidability and incompleteness in quantum infor…
Let $ \Omega \subset \mathbb{C}^m $ be an open, connected and bounded set and $\mathcal{A}(\Omega)$ be a function algebra of holomorphic functions on $\Omega$. Suppose that $\mathcal{M}_q$ is the quotient Hilbert module obtained from a…
We study the question when for a given *-algebra $\mathcal{A}$ a sequence of cones $C_n\in M_n(\mathcal{A})$ can be realized as cones of positive operators in a faithful *-representation of $\mathcal{A}$ on a Hilbert space. A…
A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semi-bounded if the corresponding operators $i\dd\pi(x)$ from the derived representations are uniformly bounded from above on some non-empty open subset…
Goedel's Incompleteness Theorems have the same scientific status as Einstein's principle of relativity, Heisenberg's uncertainty principle, and Watson and Crick's double helix model of DNA. Our aim is to discuss some new faces of the…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete…
Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…
In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…
We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.
We give a survey of current research on G\"{o}del's incompleteness theorems from the following three aspects: classifications of different proofs of G\"{o}del's incompleteness theorems, the limit of the applicability of G\"{o}del's first…
In this paper, we study Lie superalgebras of $2\times 2$ matrix-valued first-order differential operators on the complex line. We first completely classify all such superalgebras of finite dimension. Among the finite-dimensional…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
We show that Tsirelson's problem concerning the set of quantum correlations and Connes' embedding problem on finite approximations in von Neumann algebras (known to be equivalent to Kirchberg's QWEP conjecture) are essentially equivalent.…
We discuss the hypothesis that the debate about the interpretation of the orthodox formalism of quantum mechanics (QM) might have been misguided right from the start by a biased metaphysical interpretation of the formalism and its inner…
We derive faithful inclusions of C*-algebras from a coend-type construction in unitary tensor categories. This gives rise to different potential notions of discreteness for an inclusion in the non-irreducible case, and provides a unified…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…
This paper provides an E-theoretic proof of an exact form, due to E. Troitsky, of the Mischenko-Fomenko Index Theorem for elliptic pseudodifferential operators over a unital C*-algebra. The main ingredients in the proof are the use of…
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…