Undecidability in Quantum Field Theory: Physics Encounters Gödel and Turing — E8 Intelligence Research

FINDING: Undecidability (halting problem, Gödel incompleteness) extends into physics — specifically quantum field theory (QFT), where certain spectral/observable questions are provably algorithmically undecidable. | MATH: Halting problem (Turing): no algorithm decides if program halts. Gödel: any consistent formal system containing arithmetic has undecidable propositions. Tachikawa et al.: construct QFTs whose correlation functions or mass-gap existence encode halting computations — undecidability transfers via reduction (e.g., mapping a Turing machine's halting to a spectral property). No new constants; the key invariant is *computational complexity class* — undecidable = beyond recursive, not merely NP-hard. | CONNECTION: The undecidability proofs rely on encoding discrete computational states into continuous field configurations — a mapping between integer arithmetic (Z) and real-valued spectra. This mirrors the lattice/root-system structure: the halting problem's discrete states ca Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com