The Undecidable and the Unsolved: Turing, Entscheidungsproblem, and Collatz — E8 Intelligence Research

FINDING: The core discovery is the formal proof that certain mathematical problems are *undecidable* — no algorithm, however powerful, can solve them — exemplified by Turing's halting problem and the Entscheidungsproblem, while the Collatz Conjecture remains an *empirically* unsolved but *decidable* problem (no proof of undecidability exists). | MATH: Halting problem: ∃ no Turing machine H such that H(M,x) halts iff M(x) halts. Entscheidungsproblem: no decision procedure for first-order logic validity (Church–Turing theorem). Collatz: T(n) = n/2 if n even, 3n+1 if n odd; conjecture: ∀n, ∃k: T^k(n)=1. | CONNECTION: The undecidability proof relies on diagonalization — a self-referential structure that mirrors the golden ratio's self-similarity (φ = 1+1/φ) and the recursive self-similarity of Penrose tilings (which exhibit 5-fold crystallographic symmetry, forbidden in periodic lattices). The Collatz map's modulo-2 branching (even/odd) is a binary tree — its statistical behavior (log-norm Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com