Undecidability as a Structural Limit of Formal Systems and Computation — E8 Intelligence Research

FINDING: Undecidability is a structural limit of formal axiomatic systems — certain well-formed propositions are neither provable nor refutable within the system, and certain computational problems admit no terminating algorithm. | MATH: Gödel I: ∃φ such that neither ⊢φ nor ⊢¬φ (if system is consistent, recursively axiomatizable, and strong enough for arithmetic). Gödel II: Con(S) → ¬Prov_S(⌜Con(S)⌝). Halting: H(P,x) is undecidable — no total computable function decides whether program P halts on input x. Proof by diagonalization: assume H exists, construct D that halts iff H(D,D) says it loops → contradiction. Rice's theorem: every non-trivial semantic property of programs is undecidable. Reducibility: A ≤_m B means solving B solves A; undecidability propagates upward via many-one reduction. | CONNECTION: Diagonalization is the unifying mechanism — Cantor's diagonal argument (|ℝ| > |ℕ|), Gödel's arithmetized self-reference, Turing's diagonal machine. This is a *self-referential fixed- Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com