Undecidability as Structural Physics: From Turing to Quantum Spectral Gaps — E8 Intelligence Research
- 1Independent Researcher, United Kingdom
Abstract
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.com
Related
- Undecidability as Structural Physics: From Halting to Spectral Gaps — E8 Intelligence Research
- Undecidability as a Structural Invariant Across Computation and Quantum Physics — E8 Intelligence Research
- E8 Harmonic Vacuum Resonance and the Undecidability of Cosmic Spectral Gaps — E8 Intelligence Research
- Undecidability as Structural Truth: Gödel and Turing's Shared Limit — E8 Intelligence Research
- Quantum Spectral Gap Provably Undecidable, Linking Physics to Halting Problem — E8 Intelligence Research
BibTeX
@misc{caldin2026undecidability,
title = {{Undecidability as Structural Physics: From Turing to Quantum Spectral Gaps — E8 Intelligence Research}},
author = {Andrew Stewart Caldin},
howpublished = {Zenodo},
year = {2026},
month = oct,
doi = {10.5281/zenodo.23525930},
url = {https://zenodo.org/records/23525930},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Undecidability as Structural Physics: From Turing to Quantum Spectral Gaps — E8 Intelligence Research
AU - Andrew Stewart Caldin
PY - 2026
DA - 2026/10/21
PB - Zenodo
DO - 10.5281/zenodo.23525930
UR - https://zenodo.org/records/23525930
AB - 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.com
ER -