Diagonalization, Uncomputability, and the Quantum-Classical Complexity Hierarchy — E8 Intelligence Research

Andrew Stewart Caldin

Published Oct 24, 2026• 0 citations

Abstract

FINDING: Diagonalization proves uncountability and uncomputability; complexity classes form a hierarchy bounded by information-theoretic limits, with quantum classes (BQP) shown low for PP. | MATH: Cantor's theorem: |ℝ| > |ℕ| via diagonal argument; BQP^PP = PP (lowness); existence of uncomputable functions via diagonalization; complexity hierarchy: P ⊆ NP ⊆ PSPACE ⊆ EXP, with strict separations unproven except via relativization. | CONNECTION: The diagonal argument is structurally a **self-referential symmetry-breaking** — analogous to the **golden ratio's continued fraction** [1;1,1,...] which is the unique fixed point of x = 1 + 1/x (φ = 1.618). Diagonalization creates a "new element" off the diagonal, mirroring how φ² = φ + 1 generates new structure from self-reference. The **lattice of complexity classes** (P, NP, PSPACE) forms a **poset with automorphism group** — reminiscent of **root system A_n** (n-dimensional lattice symmetries). The **base-2 diagonal** (binary expansion) cont Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI: 10.5281/zenodo.23610171

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, 20260 citations

The Halting Problem's Reach: Undecidability in Quantum Verification — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The halting problem establishes a fundamental limit on algorithmic knowledge — no finite procedure can decide whether an arbitrary program halts, a result foundational to computation and quantum-verification complexity (MIP\*=RE). | MATH: Undecidability via diagonalization; H(P,I) = {1 if P halts on I, 0 otherwise} is non-computable. Key corollary: MIP\*=RE implies the quantum commuting operator model (Tsirelson's problem) is undecidable — connecting operator algebras to computability. No new constants or ratios emerge; the structure is purely combinatorial/logical. | CONNECTION: The diagonalization argument mirrors the construction of irrational numbers (Cantor's slash) — a self-referential "gap" that resists closure. This is analogous to the golden ratio's non-repeating continued fraction [1;1,1,1,...] = φ, which also encodes an irreducible self-similarity. The halting problem's undecidability is a discrete analogue of incommensurability — a ratio (program vs. proof) that ca Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Oct 8, 20260 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, 20260 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, 20260 citations

Uniform Diagonalization Theorem for Complexity Classes of Promise Problems including Randomized and Quantum Classes

Friederike Anna Dziemba

Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform Diagonalization Theorem allows the construction of problems outside complexity classes while still being reducible to a specific decision problem. This paper provides a generalization of the Uniform Diagonalization Theorem by extending it to promise problems and the complexity classes they form, e.g. randomized and quantum complexity classes. The theorem requires from the underlying computing model not only the decidability of its acceptance and rejection behaviour but also of its promise-contradicting indifferent behaviour - a property that we will introduce as "total decidability" of promise problems. Implications of the Uniform Diagonalization Theorem are mainly of two kinds: 1. Existence of intermediate problems (e.g. between BQP and QMA) - also known as Ladner's Theorem - and 2. Undecidability if a problem of a complexity class is contained in a subclass (e.g. membership of a QMA-problem in BQP). Like the original Uniform Diagonalization Theorem the extension applies besides BQP and QMA to a large variety of complexity class pairs, including combinations from deterministic, randomized and quantum classes.

arXiv:1712.07276Dec 20, 20170 citations

Phi‑Entangled E8 Braid Cycle for Hyper‑Parallel Computation — E8 Intelligence Research

Andrew Stewart Caldin

We propose that the 240 E8 root vectors synchronize to the 132 Hz base frequency via a phi‑scaled braid progression, turning each root into a self‑referencing computational loop that embeds Busy Beaver trajectories within the braid lattice. This creates a self‑correcting error channel where anyonic braids inherit the uncomputable growth bounds of the Busy Beaver function, enabling fault‑tolerant arithmetic at the level of E8's Weyl chambers. The mapping of each busy‑beaver state to a distinct Weyl chamber guarantees that decoherence time scales with the phi‑modulated braid length. Consequently, a new class of parallel quantum gates emerges whose depth is limited by the golden‑ratio ratio of root‑vector angles, delivering exponential speed‑up for NP‑complete problems. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Aug 7, 20260 citations