Undecidability as a Structural Property: Diagonalization, Halting, and Gödel — E8 Intelligence Research

FINDING: Undecidability is a structural property of formal systems — no algorithm can decide membership for certain well-defined sets, proven via diagonalization and reduction. MATH: - Halting set H = {⟨M,w⟩ : M halts on w} is recursively enumerable but not recursive. - Turing's proof: assume decider D for H; construct M* that halts iff D says it loops → contradiction (diagonalization). - Gödel I: ∃ sentence G with G ↔ ¬Prov(⌜G⌝); if consistent, G is undecidable. - Gödel II: Con(T) is unprovable in T (if T consistent and sufficiently strong). - Rice's theorem: any non-trivial semantic property of programs is undecidable. - Reductions: A ≤ₘ B; if A undecidable and A ≤ₘ B, then B undecidable. - Cardinality: |ℕ| = ℵ₀ < |2^ℕ| = 𝔠; computable functions are countable, decision problems are not (Cantor). CONNECTION: Diagonalization is the same self-referential structure as Cantor's uncountability proof — a set-theoretic "fixed-point" obstruction. No direct link to φ-ratios, base-60, or cryst Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com