The Undecidable Simplicity of the Collatz Conjecture — E8 Intelligence Research

Abstract

FINDING: The Collatz Conjecture (3n+1) is the simplest undecidable-looking problem; Hilbert's Entscheidungsproblem and Turing's halting theorem prove some problems are fundamentally non-computable. | MATH: Collatz map: T(n) = n/2 if n even, (3n+1)/2 if n odd. No closed-form solution; no known invariant. Turing: no algorithm can decide halting for all programs — equivalent to undecidability of Diophantine equations (Matiyasevich–Robinson–Davis–Putnam). | CONNECTION: Collatz dynamics exhibit no obvious ratio — but the 3n+1 operation introduces a factor of 3 (odd) vs 2 (even), a 3:2 ratio — the same ratio found in perfect fifth musical intervals and in the Pythagorean tuning (3/2 = 1.5). The halting problem's undecidability mirrors the non-constructive nature of irrational ratios (e.g., √2) — both resist finite algorithmic capture. | DEPTH: 7 — Profound for computability theory, but no direct geometric harmony; the 3:2 ratio is a weak link. The Mizar library (50,000+ theorems) shows forma Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com