The Inherent Limits of Formal Systems — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Undecidability is a structural property of formal systems — Gödel's incompleteness and Turing's halting problem reveal that any sufficiently expressive system contains truths unprovable within it, and decision problems can be provably unsolvable. | MATH: Gödel's first incompleteness theorem: for any consistent, recursively axiomatizable system \(T\) extending arithmetic, there exists a sentence \(G\) such that \(T \nvdash G\) and \(T \nvdash \neg G\). Turing's halting problem: the set \(H = \{\langle M, x \rangle : M \text{ halts on } x\}\) is not decidable — no total computable function \(f\) exists with \(f(\langle M, x \rangle) = 1\) iff \(M(x)\downarrow\). Reducibility: \(A \leq_m B\) via a computable function \(f\) such that \(x \in A \iff f(x) \in B\); undecidability transfers via reductions. | CONNECTION: The diagonalization argument underlying Gödel's proof and Turing's halting problem is structurally analogous to Cantor's diagonal argument — a self-referential symmetr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Author: Caldin, Andrew Stewart
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7204116191
Cites:
Cited by:
Related to: