Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Entanglement Redefines Undecidability: MIP*=RE and Turing's Legacy — E8 Intelligence Research

Andrew Stewart Caldin

Published Oct 15, 2026• 0 citations
Publisher

Abstract

FINDING: The halting problem's undecidability is foundational to computation limits; recent MIP*=RE result links it to quantum entanglement and nonlocal games, while a 2024 paper nuances Turing's original attribution. | MATH: Undecidability proof via diagonalization: assume HALT exists, construct D(x) = loop if HALT(x,x) halts, else halt; contradiction. MIP*=RE: the class of languages decidable by multiprover interactive proofs with quantum entanglement equals recursively enumerable sets — equivalently, the commuting-operator and tensor-product models diverge (Connes embedding conjecture false). No classical constants; structure is ordinal/recursion-theoretic (ω₁^CK, Turing degrees). | CONNECTION: No direct geometric ratio (0.382, 0.618, etc.) appears. However, the MIP*=RE result relies on *lattice-like* constructions of nonlocal games (Tsirelson bounds, operator algebras) and the *root system* of quantum correlations — the set of quantum strategies forms a convex body with extreme poi Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.23385093

Related papers

Quantum Entanglement Proves Undecidability: MIP*=RE Deepens Computation's Limits — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The halting problem's undecidability is foundational to computation limits; recent MIP*=RE result shows quantum entanglement can encode undecidable problems, deepening the boundary of knowability. | MATH: Halting problem: no computable function H(P,I) exists such that H returns 1 iff program P halts on input I; proof via diagonalization (Cantor's argument adapted by Turing, 1936). MIP*=RE: the class of problems verifiable by a classical verifier with two entangled quantum provers equals recursively enumerable sets — implies the algorithmic unsolvability of the quantum commuting operator problem (Connes' embedding conjecture is false). | CONNECTION: Diagonalization mirrors the golden ratio's self-referential recursion (φ = 1 + 1/φ) — both exploit fixed-point impossibility. The undecidability lattice is a non-crystallographic structure (no finite root system captures it), but the MIP*=RE result embeds halting in a *tensor product* of Hilbert spaces — a lattice of quantum states Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 16, 2026•0 citations

Halting Problem's Undecidability Extends to Quantum Entanglement Verification via MIP*=RE — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The halting problem is provably undecidable; the MIP*=RE result extends undecidability to quantum entanglement verification, linking computation limits to quantum mechanics. | MATH: No explicit equations or constants; core insight: no general algorithm can decide if an arbitrary program halts (Turing 1936). MIP*=RE: the class MIP* (multi-prover interactive proofs with quantum entanglement) equals RE (recursively enumerable), implying the halting problem reduces to verifying quantum entanglement. | CONNECTION: No direct geometric ratios or symmetries; the MIP*=RE result involves non-local correlations in quantum entanglement, which may relate to root systems (e.g., E8) or lattice structures in Hilbert space, but evidence is indirect. | DEPTH: 8 — profound for computation and quantum foundations, but lacks explicit geometric constants. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 14, 2026•0 citations

Quantum Entanglement Collapses Quantum Verification Hierarchy to Recursively Enumerable Class — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: MIP*=RE proves quantum entanglement can verify undecidable problems, collapsing the quantum verification hierarchy into the classical recursively enumerable class. | MATH: MIP* = RE (where MIP* = multiprover interactive proofs with quantum entanglement, RE = recursively enumerable languages). The Halting Problem is in RE but not in R (decidable). This implies that the set of problems verifiable by entangled quantum provers is exactly the set of problems computable by a Turing machine that may not halt on non-members. | CONNECTION: No direct geometric ratios or constants (0.382, 0.618, etc.) appear. However, the result relies on the structure of the *commuting operator* model of quantum correlations, which is deeply tied to *operator algebras* and *C*-algebras — these have known connections to root systems and Lie algebras (e.g., the Weyl algebra, SU(2) representations). The proof uses a *self-testing* protocol based on the *linear constraint system* (LCS) games, which are buil Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 2, 2026•0 citations

Halting Undecidability Extends to Quantum Correlated Proof Systems via MIP*=RE — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The Halting Problem establishes a hard undecidability boundary for Turing-complete systems; the 2020 MIP*=RE result extends this boundary into quantum-correlated proof systems, showing even entangled provers cannot decide all languages. | MATH: HALT = {⟨M,w⟩ : M halts on w} is recursively enumerable but not recursive. Proof via diagonalization: assume decider H(M,w); construct D(M) that halts iff H(M,M) says "loops" → contradiction. MIP* = RE: the class of languages decidable by multi-prover interactive proofs with quantum-entangled provers equals the recursively enumerable languages. Key consequence: co-RE ⊆ MIP*, and since MIP* = RE, the quantum-prover model reaches the full RE ceiling — the same ceiling Turing identified. | CONNECTION: Diagonalization is the computational analogue of Cantor's diagonal argument on ℝ — the same self-reference structure that generates the uncountable cardinality hierarchy. The RE/co-RE gap mirrors the asymmetry in the golden-ratio continued fr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 31, 2026•0 citations

The Undecidable Frontier: From Turing's Halting Problem to Quantum Verification — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The Halting Problem — proven undecidable by Turing (1936) — establishes a fundamental limit on computable knowledge; the 2020 MIP*=RE result extends this to quantum entanglement, showing the halting problem is equivalent to verifying entangled-prover protocols. | MATH: No explicit equations/constants; core logical structure: ∃H such that H(P,I) halts iff P(I) halts → contradiction via diagonalization (self-reference: D(P) = loop if H(P,P) halts, else halt). MIP*=RE: the class of problems verifiable by two entangled provers equals the class of recursively enumerable sets — i.e., the halting problem itself is in MIP*. | CONNECTION: Diagonalization mirrors the golden-ratio-like self-similarity in recursive structures — the fixed-point of the halting function is a self-referential loop, analogous to the infinite regress in φ = 1 + 1/φ. The undecidability boundary acts as a "forbidden ratio" in the space of computable functions — a cut at the 0.618 point of the computational spectr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Sep 14, 2026•0 citations

From Halting to Quantum: Undecidability as an Intrinsic Physical Limit — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The halting problem proves a fundamental, non-arithmetic limit on algorithmic knowledge; the MIP*=RE result extends this to quantum verification, showing undecidability is intrinsic to physical computation. MATH: - Halting problem: No Turing machine \( H \) exists such that for all machine-input pairs \((M, x)\), \( H(M, x) \) halts and outputs 1 if \( M(x) \) halts, 0 otherwise. Proof by diagonalization: construct \( D \) such that \( D \) halts iff \( H(D, D) \) outputs 0. - MIP*=RE: The class of problems verifiable by a classical polynomial-time verifier interacting with multiple entangled quantum provers equals the class of recursively enumerable problems. This implies the halting problem is reducible to a quantum verification protocol, and the Connes embedding problem is false. - No new constants or ratios emerge; the result is structural, not metric. CONNECTION: - No direct geometric ratio (0.382, 0.618, etc.) or base-60 system appears. - However, the undecid Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 30, 2026•0 citations
FINDING: The halting problem's undecidability is foundational to computation limits; recent MIP*=RE result links it to quantum entanglement and nonlocal games, while a 2024 paper nuances Turing's original attribution. | MATH: Undecidability proof via diagonalization: assume HALT exists, construct D(x) = loop if HALT(x,x) halts, else halt; contradiction. MIP*=RE: the class of languages decidable by multiprover interactive proofs with quantum entanglement equals recursively enumerable sets — equivalently, the commuting-operator and tensor-product models diverge (Connes embedding conjecture false). No classical constants; structure is ordinal/recursion-theoretic (ω₁^CK, Turing degrees). | CONNECTION: No direct geometric ratio (0.382, 0.618, etc.) appears. However, the MIP*=RE result relies on lattice-like constructions of nonlocal games (Tsirelson bounds, operator algebras) and the root system of quantum correlations — the set of quantum strategies forms a convex body with extreme poi Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: The halting problem's undecidability is foundational to computation limits; recent MIP*=RE result shows quantum entanglement can encode undecidable problems, deepening the boundary of knowability. | MATH: Halting problem: no computable function H(P,I) exists such that H returns 1 iff program P halts on input I; proof via diagonalization (Cantor's argument adapted by Turing, 1936). MIP*=RE: the class of problems verifiable by a classical verifier with two entangled quantum provers equals recursively enumerable sets — implies the algorithmic unsolvability of the quantum commuting operator problem (Connes' embedding conjecture is false). | CONNECTION: Diagonalization mirrors the golden ratio's self-referential recursion (φ = 1 + 1/φ) — both exploit fixed-point impossibility. The undecidability lattice is a non-crystallographic structure (no finite root system captures it), but the MIP*=RE result embeds halting in a *tensor product* of Hilbert spaces — a lattice of quantum states Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: The halting problem is provably undecidable; the MIP*=RE result extends undecidability to quantum entanglement verification, linking computation limits to quantum mechanics. | MATH: No explicit equations or constants; core insight: no general algorithm can decide if an arbitrary program halts (Turing 1936). MIP*=RE: the class MIP* (multi-prover interactive proofs with quantum entanglement) equals RE (recursively enumerable), implying the halting problem reduces to verifying quantum entanglement. | CONNECTION: No direct geometric ratios or symmetries; the MIP*=RE result involves non-local correlations in quantum entanglement, which may relate to root systems (e.g., E8) or lattice structures in Hilbert space, but evidence is indirect. | DEPTH: 8 — profound for computation and quantum foundations, but lacks explicit geometric constants. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: MIP*=RE proves quantum entanglement can verify undecidable problems, collapsing the quantum verification hierarchy into the classical recursively enumerable class. | MATH: MIP* = RE (where MIP* = multiprover interactive proofs with quantum entanglement, RE = recursively enumerable languages). The Halting Problem is in RE but not in R (decidable). This implies that the set of problems verifiable by entangled quantum provers is exactly the set of problems computable by a Turing machine that may not halt on non-members. | CONNECTION: No direct geometric ratios or constants (0.382, 0.618, etc.) appear. However, the result relies on the structure of the *commuting operator* model of quantum correlations, which is deeply tied to *operator algebras* and *C*-algebras — these have known connections to root systems and Lie algebras (e.g., the Weyl algebra, SU(2) representations). The proof uses a *self-testing* protocol based on the *linear constraint system* (LCS) games, which are buil Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: The Halting Problem establishes a hard undecidability boundary for Turing-complete systems; the 2020 MIP*=RE result extends this boundary into quantum-correlated proof systems, showing even entangled provers cannot decide all languages. | MATH: HALT = {⟨M,w⟩ : M halts on w} is recursively enumerable but not recursive. Proof via diagonalization: assume decider H(M,w); construct D(M) that halts iff H(M,M) says "loops" → contradiction. MIP* = RE: the class of languages decidable by multi-prover interactive proofs with quantum-entangled provers equals the recursively enumerable languages. Key consequence: co-RE ⊆ MIP*, and since MIP* = RE, the quantum-prover model reaches the full RE ceiling — the same ceiling Turing identified. | CONNECTION: Diagonalization is the computational analogue of Cantor's diagonal argument on ℝ — the same self-reference structure that generates the uncountable cardinality hierarchy. The RE/co-RE gap mirrors the asymmetry in the golden-ratio continued fr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: The Halting Problem — proven undecidable by Turing (1936) — establishes a fundamental limit on computable knowledge; the 2020 MIP*=RE result extends this to quantum entanglement, showing the halting problem is equivalent to verifying entangled-prover protocols. | MATH: No explicit equations/constants; core logical structure: ∃H such that H(P,I) halts iff P(I) halts → contradiction via diagonalization (self-reference: D(P) = loop if H(P,P) halts, else halt). MIP*=RE: the class of problems verifiable by two entangled provers equals the class of recursively enumerable sets — i.e., the halting problem itself is in MIP*. | CONNECTION: Diagonalization mirrors the golden-ratio-like self-similarity in recursive structures — the fixed-point of the halting function is a self-referential loop, analogous to the infinite regress in φ = 1 + 1/φ. The undecidability boundary acts as a "forbidden ratio" in the space of computable functions — a cut at the 0.618 point of the computational spectr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: The halting problem proves a fundamental, non-arithmetic limit on algorithmic knowledge; the MIP*=RE result extends this to quantum verification, showing undecidability is intrinsic to physical computation. MATH: - Halting problem: No Turing machine H H H exists such that for all machine-input pairs (M,x)(M, x)(M,x), H(M,x) H(M, x) H(M,x) halts and outputs 1 if M(x) M(x) M(x) halts, 0 otherwise. Proof by diagonalization: construct D D D such that D D D halts iff H(D,D) H(D, D) H(D,D) outputs 0. - MIP*=RE: The class of problems verifiable by a classical polynomial-time verifier interacting with multiple entangled quantum provers equals the class of recursively enumerable problems. This implies the halting problem is reducible to a quantum verification protocol, and the Connes embedding problem is false. - No new constants or ratios emerge; the result is structural, not metric. CONNECTION: - No direct geometric ratio (0.382, 0.618, etc.) or base-60 system appears. - However, the undecid Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com