Undecidability as Structural Physics: From Halting to Spectral Gaps — E8 Intelligence Research

Andrew Stewart Caldin

Published Oct 22, 2026• 0 citations

Abstract

FINDING: Undecidability is not a computational artifact but a structural feature of formal systems, now extending into quantum many-body physics — where the halting problem maps onto spectral gap questions. | MATH: Halting problem (Turing, 1936): no computable function H(P,I) decides if program P halts on input I. Gödel incompleteness: for any consistent, recursively axiomatizable theory T ⊇ Robinson arithmetic, ∃ sentence G with T⊬G and T⊬¬G. Reducibility: A ≤_T B via Turing reduction — solving B solves A. Quantum extension: the spectral gap problem (given a translationally invariant local Hamiltonian, does the gap vanish in the thermodynamic limit?) is undecidable (Cubitt, Perez-Garcia, Wolf, 2015) — proof uses a lattice of spins encoding a Turing machine's halting behavior into the gap's existence. | CONNECTION: The undecidability proofs rely on encoding computation into discrete lattices — the quantum result uses a 2D spin lattice with local interactions, echoing crystallographic l Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI: 10.5281/zenodo.23553745

Related papers

Undecidability as a Structural Invariant from Computability to Quantum Physics — E8 Intelligence Research

Andrew Stewart Caldin

Oct 6, 20260 citations

Undecidability as Structural Physics: From Turing to Quantum Spectral Gaps — E8 Intelligence Research

Andrew Stewart Caldin

Oct 21, 20260 citations

Undecidable Problems in Physics: From Computation to Quantum Fields — E8 Intelligence Research

Andrew Stewart Caldin

Jul 25, 20260 citations

Spectral Gap Problem Undecidable: Turing Limits in Quantum Many-Body Physics — E8 Intelligence Research

Andrew Stewart Caldin

Oct 28, 20260 citations

Quantum Spectral Gap Provably Undecidable, Linking Physics to Halting Problem — E8 Intelligence Research

Andrew Stewart Caldin

Oct 26, 20260 citations

Undecidability of the Spectral Gap Problem via Halting Problem Encoding — E8 Intelligence Research

Andrew Stewart Caldin

Jul 20, 20260 citations

Undecidability as Structural Physics: From Halting to Spectral Gaps — E8 Intelligence Research

Andrew Stewart Caldin

Published Oct 22, 2026• 0 citations

Publisher

Abstract

DOI: 10.5281/zenodo.23553745

Related papers

Undecidability as a Structural Invariant from Computability to Quantum Physics — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Undecidability is not a peripheral paradox but a structural invariant of formal systems, extending from classical computability (halting problem) into quantum many-body physics, where spectral gaps and ground-state properties become provably non-computable. | MATH: Halting problem: no Turing machine H exists s.t. H(P,I) halts iff P(I) halts — diagonalization proof yields contradiction via self-reference. Gödel: for any consistent, recursively axiomatizable system S containing arithmetic, ∃ sentence G with S⊬G and S⊬¬G. Quantum extension: the spectral gap problem (given a translation-invariant local Hamiltonian on a lattice, does the gap between ground and first excited state vanish in the thermodynamic limit?) is undecidable — reduction from the halting problem to 2D spin-lattice Hamiltonians (Cubitt, Perez-Garcia, Wolf, 2015). | CONNECTION: The undecidability proofs rely on encoding computation into lattice structures — the 2D square lattice (crystallographic symmetry p4m) se Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Undecidability is not a peripheral paradox but a structural invariant of formal systems, extending from classical computability (halting problem) into quantum many-body physics, where spectral gaps and ground-state properties become provably non-computable. | MATH: Halting problem: no Turing machine H exists s.t. H(P,I) halts iff P(I) halts — diagonalization proof yields contradiction via self-reference. Gödel: for any consistent, recursively axiomatizable system S containing arithmetic, ∃ sentence G with S⊬G and S⊬¬G. Quantum extension: the spectral gap problem (given a translation-invariant local Hamiltonian on a lattice, does the gap between ground and first excited state vanish in the thermodynamic limit?) is undecidable — reduction from the halting problem to 2D spin-lattice Hamiltonians (Cubitt, Perez-Garcia, Wolf, 2015). | CONNECTION: The undecidability proofs rely on encoding computation into lattice structures — the 2D square lattice (crystallographic symmetry p4m) se Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Oct 6, 20260 citations

Undecidability as Structural Physics: From Turing to Quantum Spectral Gaps — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Undecidability is not a computational artifact but a structural feature of formal systems — it propagates into physics (quantum many-body problems, spectral gaps) via reduction, revealing a hierarchy of unknowability. | MATH: Halting problem (Turing, 1936): no computable function H(p,i) decides if program p halts on input i. Gödel's incompleteness: for any consistent formal system F containing arithmetic, ∃ statement G_F such that F⊬G_F and F⊬¬G_F. Reduction: Problem A ≤_T Problem B means an oracle for B solves A; undecidability transfers A ≤ B ⇒ B undecidable. Quantum analog: spectral gap problem (Cubitt, Perez-Garcia, Wolf, 2015) — determining if a 2D spin-lattice Hamiltonian has a gap above ground state is undecidable (reduction from halting problem to Hamiltonian construction). | CONNECTION: The reduction lattice forms a partial order with a maximal undecidable class (Σ₁⁰-complete) — structurally analogous to root system hierarchies (e.g., E₈ has 240 roots; the undecidabil Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Undecidability is not a computational artifact but a structural feature of formal systems — it propagates into physics (quantum many-body problems, spectral gaps) via reduction, revealing a hierarchy of unknowability. | MATH: Halting problem (Turing, 1936): no computable function H(p,i) decides if program p halts on input i. Gödel's incompleteness: for any consistent formal system F containing arithmetic, ∃ statement G_F such that F⊬G_F and F⊬¬G_F. Reduction: Problem A ≤_T Problem B means an oracle for B solves A; undecidability transfers A ≤ B ⇒ B undecidable. Quantum analog: spectral gap problem (Cubitt, Perez-Garcia, Wolf, 2015) — determining if a 2D spin-lattice Hamiltonian has a gap above ground state is undecidable (reduction from halting problem to Hamiltonian construction). | CONNECTION: The reduction lattice forms a partial order with a maximal undecidable class (Σ₁⁰-complete) — structurally analogous to root system hierarchies (e.g., E₈ has 240 roots; the undecidabil Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Oct 21, 20260 citations

Undecidable Problems in Physics: From Computation to Quantum Fields — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Undecidable problems extend from computation to quantum field theory and many-body physics, revealing fundamental limits on what can be known or computed about physical systems. | MATH: Halting problem: no Turing machine can decide if an arbitrary program halts (Turing 1936). Gödel incompleteness: any consistent formal system containing arithmetic has true but unprovable statements. Reducibility: problem A reduces to B if solving B solves A (A ≤ B). In QFT, spectral gap problem is undecidable (Cubitt, Perez-Garcia, Wolf 2015): no algorithm can determine if a quantum many-body system has a nonzero energy gap. | CONNECTION: Undecidability in physics often arises from encoding Turing machines into Hamiltonian lattice systems — this maps computational logic onto geometric lattice structures (e.g., 2D spin lattices with local interactions). The spectral gap problem's undecidability proof uses aperiodic tilings and translation-invariant Hamiltonians, linking to crystallographic symm Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Undecidable problems extend from computation to quantum field theory and many-body physics, revealing fundamental limits on what can be known or computed about physical systems. | MATH: Halting problem: no Turing machine can decide if an arbitrary program halts (Turing 1936). Gödel incompleteness: any consistent formal system containing arithmetic has true but unprovable statements. Reducibility: problem A reduces to B if solving B solves A (A ≤ B). In QFT, spectral gap problem is undecidable (Cubitt, Perez-Garcia, Wolf 2015): no algorithm can determine if a quantum many-body system has a nonzero energy gap. | CONNECTION: Undecidability in physics often arises from encoding Turing machines into Hamiltonian lattice systems — this maps computational logic onto geometric lattice structures (e.g., 2D spin lattices with local interactions). The spectral gap problem's undecidability proof uses aperiodic tilings and translation-invariant Hamiltonians, linking to crystallographic symm Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Jul 25, 20260 citations

Spectral Gap Problem Undecidable: Turing Limits in Quantum Many-Body Physics — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The spectral gap problem is undecidable in general — no algorithm can determine whether a quantum many-body Hamiltonian has a spectral gap or is gapless, establishing a Gödel/Turing-style limit inside physics itself. | MATH: Given a translation-invariant, nearest-neighbour Hamiltonian H on a 2D spin lattice, the ground-state energy density and the question "is Δ = E₁ − E₀ > 0?" are undecidable (Cubitt, Pérez-García, Wolf, Nature 2015). The construction encodes a universal Turing machine into the low-energy spectrum; the spectral gap's presence/absence maps to halting/non-halting. | CONNECTION: No direct golden-ratio or crystallographic constant appears in the undecidability result itself. The relevant symmetry structure is the 2D lattice translation group ℤ² and the local SU(2)/finite-group gauge structure of the spin Hamiltonian — a lattice/crystallographic setting, but the undecidability is a logical (computability) property, not a geometric-harmony ratio. | DEPTH: 9 FINDIN Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: The spectral gap problem is undecidable in general — no algorithm can determine whether a quantum many-body Hamiltonian has a spectral gap or is gapless, establishing a Gödel/Turing-style limit inside physics itself. | MATH: Given a translation-invariant, nearest-neighbour Hamiltonian H on a 2D spin lattice, the ground-state energy density and the question "is Δ = E₁ − E₀ > 0?" are undecidable (Cubitt, Pérez-García, Wolf, Nature 2015). The construction encodes a universal Turing machine into the low-energy spectrum; the spectral gap's presence/absence maps to halting/non-halting. | CONNECTION: No direct golden-ratio or crystallographic constant appears in the undecidability result itself. The relevant symmetry structure is the 2D lattice translation group ℤ² and the local SU(2)/finite-group gauge structure of the spin Hamiltonian — a lattice/crystallographic setting, but the undecidability is a logical (computability) property, not a geometric-harmony ratio. | DEPTH: 9 FINDIN Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Oct 28, 20260 citations

Quantum Spectral Gap Provably Undecidable, Linking Physics to Halting Problem — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The spectral gap problem — determining whether a quantum Hamiltonian's energy spectrum has a gap above the ground state — is provably undecidable in general, linking quantum many-body physics to the halting problem and Gödelian limits. | MATH: The key construction (Cubitt, Perez-Garcia, Wolf, 2015) reduces the halting problem to a family of 2D spin-lattice Hamiltonians $H(n)$ on a fixed lattice, where the spectral gap (difference between ground state energy $E_0$ and first excited state $E_1$ ) is either $\Delta > 0$ (gapped) or $\Delta = 0$ (gapless), depending on whether a Turing machine halts. The Hamiltonian is built from translationally invariant local terms with frustration-free ground states; the gap closes as $\Delta \sim 1/\text{poly}(n)$ in the gapless case. No closed-form equation for $\Delta$ exists — it is algorithmically uncomputable. | CONNECTION: The construction uses a lattice structure (square lattice, 2D) with local interaction ter Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: The spectral gap problem — determining whether a quantum Hamiltonian's energy spectrum has a gap above the ground state — is provably undecidable in general, linking quantum many-body physics to the halting problem and Gödelian limits. | MATH: The key construction (Cubitt, Perez-Garcia, Wolf, 2015) reduces the halting problem to a family of 2D spin-lattice Hamiltonians $ H(n) $ on a fixed lattice, where the spectral gap (difference between ground state energy $ E_0 $ and first excited state $ E_1 $) is either $ \Delta > 0 $ (gapped) or $ \Delta = 0 $ (gapless), depending on whether a Turing machine halts. The Hamiltonian is built from translationally invariant local terms with frustration-free ground states; the gap closes as $ \Delta \sim 1/\text{poly}(n) $ in the gapless case. No closed-form equation for $ \Delta $ exists — it is algorithmically uncomputable. | CONNECTION: The construction uses a lattice structure (square lattice, 2D) with local interaction ter Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Oct 26, 20260 citations

Undecidability of the Spectral Gap Problem via Halting Problem Encoding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Undecidability in the spectral gap problem for quantum many-body systems proves that determining whether a system is gapped or gapless is algorithmically impossible in general. | MATH: The spectral gap problem is mapped to the halting problem via translationally invariant Hamiltonians on a 2D lattice; the set of gapped Hamiltonians is Π₂-complete in the arithmetic hierarchy. Key constants: no specific numerical constants emerge, but the proof relies on encoding Turing machine states into local Hamiltonian terms. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, etc.) appear. However, the lattice structure (2D square lattice) and translational invariance connect to crystallographic symmetry groups (p4m wallpaper group). The undecidability result implies that spectral gaps—which determine whether a system is an insulator (gapped) or conductor (gapless)—cannot be universally predicted, breaking the dream of a complete mathematical description of matter. | DEPTH: 9/1 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Undecidability in the spectral gap problem for quantum many-body systems proves that determining whether a system is gapped or gapless is algorithmically impossible in general. | MATH: The spectral gap problem is mapped to the halting problem via translationally invariant Hamiltonians on a 2D lattice; the set of gapped Hamiltonians is Π₂-complete in the arithmetic hierarchy. Key constants: no specific numerical constants emerge, but the proof relies on encoding Turing machine states into local Hamiltonian terms. | CONNECTION: No direct geometric harmony ratios (0.382, 0.618, etc.) appear. However, the lattice structure (2D square lattice) and translational invariance connect to crystallographic symmetry groups (p4m wallpaper group). The undecidability result implies that spectral gaps—which determine whether a system is an insulator (gapped) or conductor (gapless)—cannot be universally predicted, breaking the dream of a complete mathematical description of matter. | DEPTH: 9/1 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Jul 20, 20260 citations

H(n)

on a fixed lattice, where the spectral gap (difference between ground state energy

E_0

and first excited state

E_1

) is either

\Delta > 0

(gapped) or

\Delta = 0

(gapless), depending on whether a Turing machine halts. The Hamiltonian is built from translationally invariant local terms with frustration-free ground states; the gap closes as

\Delta \sim 1/\text{poly}(n)

in the gapless case. No closed-form equation for

\Delta

exists — it is algorithmically uncomputable. | CONNECTION: The construction uses a lattice structure (square lattice, 2D) with local interaction ter Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com