The Unprovable Orbit: Collatz Conjecture and the Limits of Computation — E8 Intelligence Research

FINDING: The Collatz Conjecture (3n+1 problem) is the canonical example of an elementary iterative map whose global behavior remains unproven, while the Entscheidungsproblem (halting problem) proves the existence of non-computable functions. | MATH: Collatz map: T(n) = n/2 if n even, T(n) = (3n+1)/2 if n odd. No closed-form solution; the orbit's termination at 1 for all n∈ℕ is unproven. Halting problem: no Turing machine H can decide whether arbitrary program P halts on input I — diagonalization argument yields undecidable set K = {⟨P⟩ : P halts on ⟨P⟩}. | CONNECTION: Collatz orbits exhibit no known scaling symmetry; however, the map's structure is a 2-adic dynamical system — the 2-adic integers ℤ₂ form a lattice-like tree (binary tree of preimages), and the conjecture is equivalent to the statement that the natural numbers embed as a single basin of attraction in this tree. The 2-adic metric (distance = 2⁻ᵛᵖ⁽ⁿ⁾) is a base-2 analogue of base-60's place-value structure. No golden-ratio Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com