{
  "abstract": "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\n\nAuthor: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com",
  "abstract_shown": true,
  "affiliations": [
    "Independent Researcher, United Kingdom"
  ],
  "article_type": null,
  "arxiv": null,
  "author_total": 1,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Andrew Stewart Caldin"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/chtnxae74c268.bib",
  "cited_by": 0,
  "doi": "10.5281/zenodo.23409610",
  "fulltext_url": null,
  "id": "chtnxae74c268",
  "issns": [],
  "landing_url": "https://zenodo.org/records/23409610",
  "language": "eng",
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [],
  "openalex": null,
  "pdf_url": null,
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-16",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/chtnxae74c268.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:28Z",
      "native_id": "23409610",
      "source": "zenodo",
      "url": "https://zenodo.org/records/23409610"
    }
  ],
  "subjects": [],
  "title": "Quantum Entanglement Proves Undecidability: MIP*=RE Deepens Computation's Limits — E8 Intelligence Research",
  "title_text": "Quantum Entanglement Proves Undecidability: MIP*=RE Deepens Computation's Limits — E8 Intelligence Research",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:28Z",
  "url": "https://research.draconitic.com/paper/chtnxae74c268",
  "venue": "Zenodo",
  "versions": []
}