The Unprovable Boundary: Collatz and Turing's Halting Problem — E8 Intelligence Research

FINDING: The Collatz Conjecture and the Entscheidungsproblem define the boundary of computable arithmetic; Collatz remains unproven, while Turing proved the halting problem is undecidable. | MATH: Collatz map: T(n) = n/2 if n even, 3n+1 if n odd; conjectured to reach 1 for all n ∈ ℕ⁺. Turing: no algorithm exists to decide whether an arbitrary Turing machine halts — formalized via the halting set K = {⟨M⟩ : M halts on input ⟨M⟩}, which is recursively enumerable but not decidable. Hilbert's Entscheidungsproblem: ∃ an effective procedure to decide validity of first-order logic sentences — answered negatively by Church–Turing (1936). | CONNECTION: Collatz iterates exhibit chaotic orbits with no known closed form; however, the 3n+1 operation is a linear congruence modulo 2, and the parity vector (n mod 2, T(n) mod 2, …) is a binary sequence that maps to a 2-adic integer — this is a lattice structure on ℤ₂, the 2-adic integers, which is a compact abelian group with Haar measure. The 2-adic d Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com