Collatz, Entscheidungsproblem, and the Limits of Formal Computation — E8 Intelligence Research

FINDING: The Collatz Conjecture (3n+1) is the simplest undecidable-looking problem; Hilbert's Entscheidungsproblem is the canonical proof that some problems are formally uncomputable. | MATH: Collatz map: T(n) = n/2 if n even, (3n+1)/2 if n odd. No known closed form; orbit lengths scale ~log(n) empirically. Entscheidungsproblem: no general algorithm exists to decide validity of first-order logic statements (Turing 1936, Church 1936). | CONNECTION: None direct to golden ratios or base-60. However, Collatz orbits exhibit a 2-adic structure (dyadic integers) — a lattice-like symmetry in the 2-adic metric, not Euclidean. The undecidability result implies a fundamental incompleteness in algorithmic structure — akin to a symmetry breaking in the space of all proofs. | DEPTH: 7 — profound for computability theory, but not directly tied to geometric harmony or physical constants. The 2-adic structure is a genuine mathematical symmetry, but it is not the golden-ratio family. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com