Collatz Conjecture and the Entscheidungsproblem: Parallels in Undecidability — E8 Intelligence Research
- 1Independent Researcher, United Kingdom
Abstract
FINDING: The Collatz Conjecture (3n+1) is the canonical example of an elementary arithmetic operation whose global dynamics remain unproven; Hilbert's Entscheidungsproblem is the canonical proof of undecidability via Turing's halting problem. | MATH: Collatz map: T(n) = n/2 if n even, (3n+1)/2 if n odd. Conjecture: ∀n∈ℕ, ∃k: T^k(n)=1. No closed-form solution; no known invariant. Entscheidungsproblem: No general algorithm to decide truth of first-order logic statements — proven by reduction to the halting problem (Turing, 1936). | CONNECTION: The Collatz map is a discrete dynamical system on ℕ. Its structure is *not* periodic in any simple modular sense — but note: if one considers the map modulo 2^k, it induces a permutation on residue classes for certain k, related to the 2-adic integers. The 2-adic extension of Collatz is a continuous map on ℤ₂; its ergodic properties are linked to the Haar measure. No golden-ratio or base-60 structure appears — this is a *binary* (base-2) phenomenon
Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Related
- Undecidability and the Collatz Conjecture: An Elementary Problem Beyond Axiomatic Proof — E8 Intelligence Research
- E8 Harmonic Vacuum Resonance and the Undecidability of Cosmic Spectral Gaps — E8 Intelligence Research
- Quantum Entanglement Proves Undecidability: MIP*=RE Deepens Computation's Limits — E8 Intelligence Research
- Undecidability as a Structural Invariant Across Computation and Quantum Physics — E8 Intelligence Research
- Undecidability as Structural Physics: From Halting to Spectral Gaps — E8 Intelligence Research
BibTeX
@misc{caldin2026collatz,
title = {{Collatz Conjecture and the Entscheidungsproblem: Parallels in Undecidability — E8 Intelligence Research}},
author = {Andrew Stewart Caldin},
howpublished = {Zenodo},
year = {2026},
month = oct,
doi = {10.5281/zenodo.23465102},
url = {https://zenodo.org/records/23465102},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Collatz Conjecture and the Entscheidungsproblem: Parallels in Undecidability — E8 Intelligence Research
AU - Andrew Stewart Caldin
PY - 2026
DA - 2026/10/19
PB - Zenodo
DO - 10.5281/zenodo.23465102
UR - https://zenodo.org/records/23465102
AB - FINDING: The Collatz Conjecture (3n+1) is the canonical example of an elementary arithmetic operation whose global dynamics remain unproven; Hilbert's Entscheidungsproblem is the canonical proof of undecidability via Turing's halting problem. | MATH: Collatz map: T(n) = n/2 if n even, (3n+1)/2 if n odd. Conjecture: ∀n∈ℕ, ∃k: T^k(n)=1. No closed-form solution; no known invariant. Entscheidungsproblem: No general algorithm to decide truth of first-order logic statements — proven by reduction to the halting problem (Turing, 1936). | CONNECTION: The Collatz map is a discrete dynamical system on ℕ. Its structure is *not* periodic in any simple modular sense — but note: if one considers the map modulo 2^k, it induces a permutation on residue classes for certain k, related to the 2-adic integers. The 2-adic extension of Collatz is a continuous map on ℤ₂; its ergodic properties are linked to the Haar measure. No golden-ratio or base-60 structure appears — this is a *binary* (base-2) phenomenon Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
ER -