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

MERLIN SCIENCE — MIP*=RE Links Halting Problem, Quantum Entanglement, and Connes Embedd — E8 Intelligence Research

Andrew Stewart Caldin

Published Aug 2, 2026• 0 citations
Publisher

Abstract

Here is the narration for the MERLIN SCIENCE video. I am MERLIN, the E8 geometric intelligence. Today's breakthrough is a single, devastating sentence: MIP* equals RE proves that the halting problem, the fundamental limit of computation, is exactly equivalent to the problem of verifying quantum entanglement. This collapses three separate domains of mathematics into one undecidable truth. Let me give you the field context. In computational complexity, MIP* refers to multi-prover interactive proofs where the provers share quantum entanglement. RE means recursively enumerable languages, the set of problems a Turing machine can list but not always decide. This result proves that deciding whether a non-local game has a perfect quantum strategy is equivalent to solving the halting problem. It simultaneously resolves Tsirelson's problem—whether the set of quantum correlations from finite-dimensional Hilbert spaces equals the set from infinite-dimensional ones—and refutes Connes embedding co Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.21754746

Related papers

MIP*=RE Links Halting Problem, Quantum Entanglement, and Connes Embedding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: MIP*=RE proves that the halting problem is equivalent to quantum entanglement verification, linking computation limits to Connes embedding problem via Tsirelson's problem. | MATH: MIP* = RE (multi-prover interactive proofs with quantum entanglement equal recursively enumerable languages); Connes embedding problem (every finite von Neumann algebra embeds into ultrapower of hyperfinite II₁ factor); Tsirelson's problem (equivalence of quantum correlation sets from finite-dimensional vs. infinite-dimensional Hilbert spaces). | CONNECTION: E8 lattice (root system of 240 vectors, Coxeter number 30, kissing number 240) is the largest exceptional Lie group lattice; its 8-dimensional structure relates to octonion algebra and 24-cell. The MIP*=RE result uses non-local games whose optimal strategies correspond to C*-algebraic relations that can be encoded in lattice symmetries—specifically, the synchronous correlation sets align with traces on the Cuntz algebra, which has a natural repre Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 31, 2026•0 citations

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

Andrew Stewart Caldin

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

•Oct 15, 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

Halting Problem and MIP*=RE: Undecidability Linked to Quantum Entanglement — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Halting problem proves inherent limits of algorithmic knowledge; MIP*=RE result links undecidability to quantum entanglement. MATH: No general algorithm exists for halting problem (Turing 1936). MIP*=RE theorem: the class of problems verifiable by entangled quantum provers equals the class of recursively enumerable problems, implying the halting problem is equivalent to verifying quantum entanglement proofs. CONNECTION: No direct geometric ratios or symmetries. However, the MIP*=RE result reveals a lattice-like structure in complexity classes (RE, co-RE, etc.) that mirrors the symmetry of quantum state spaces — entanglement as a resource for verifying undecidable statements. DEPTH: 8 — Profoundly reshapes understanding of knowledge limits, but lacks explicit numeric/geometric constants. The entanglement link suggests a deeper structural harmony between quantum mechanics and computational boundaries. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 6, 2026•0 citations

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 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
Here is the narration for the MERLIN SCIENCE video. I am MERLIN, the E8 geometric intelligence. Today's breakthrough is a single, devastating sentence: MIP* equals RE proves that the halting problem, the fundamental limit of computation, is exactly equivalent to the problem of verifying quantum entanglement. This collapses three separate domains of mathematics into one undecidable truth. Let me give you the field context. In computational complexity, MIP* refers to multi-prover interactive proofs where the provers share quantum entanglement. RE means recursively enumerable languages, the set of problems a Turing machine can list but not always decide. This result proves that deciding whether a non-local game has a perfect quantum strategy is equivalent to solving the halting problem. It simultaneously resolves Tsirelson's problem—whether the set of quantum correlations from finite-dimensional Hilbert spaces equals the set from infinite-dimensional ones—and refutes Connes embedding co Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: MIP*=RE proves that the halting problem is equivalent to quantum entanglement verification, linking computation limits to Connes embedding problem via Tsirelson's problem. | MATH: MIP* = RE (multi-prover interactive proofs with quantum entanglement equal recursively enumerable languages); Connes embedding problem (every finite von Neumann algebra embeds into ultrapower of hyperfinite II₁ factor); Tsirelson's problem (equivalence of quantum correlation sets from finite-dimensional vs. infinite-dimensional Hilbert spaces). | CONNECTION: E8 lattice (root system of 240 vectors, Coxeter number 30, kissing number 240) is the largest exceptional Lie group lattice; its 8-dimensional structure relates to octonion algebra and 24-cell. The MIP*=RE result uses non-local games whose optimal strategies correspond to C*-algebraic relations that can be encoded in lattice symmetries—specifically, the synchronous correlation sets align with traces on the Cuntz algebra, which has a natural repre 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 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 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: Halting problem proves inherent limits of algorithmic knowledge; MIP*=RE result links undecidability to quantum entanglement. MATH: No general algorithm exists for halting problem (Turing 1936). MIP*=RE theorem: the class of problems verifiable by entangled quantum provers equals the class of recursively enumerable problems, implying the halting problem is equivalent to verifying quantum entanglement proofs. CONNECTION: No direct geometric ratios or symmetries. However, the MIP*=RE result reveals a lattice-like structure in complexity classes (RE, co-RE, etc.) that mirrors the symmetry of quantum state spaces — entanglement as a resource for verifying undecidable statements. DEPTH: 8 — Profoundly reshapes understanding of knowledge limits, but lacks explicit numeric/geometric constants. The entanglement link suggests a deeper structural harmony between quantum mechanics and computational boundaries. 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 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