Undecidability and the Collatz Conjecture: An Elementary Problem Beyond Axiomatic Proof — E8 Intelligence Research
- 1Independent Researcher, United Kingdom
Abstract
FINDING: The core mathematical insight is the existence of *undecidable* problems — problems whose truth is independent of any fixed axiomatic system (Gödel/Turing) — and the Collatz Conjecture as a concrete, elementary example of a problem with no known proof or disproof, whose behavior is computationally irreducible. | MATH: Collatz map: T(n) = n/2 if n even; T(n) = 3n+1 if n odd. Conjecture: ∀ n ∈ ℕ, ∃ k: Tk(n) = 1. No closed-form solution; no known invariant. Turing's halting problem: H(P,i) — no computable function decides if program P halts on input i. Hilbert's Entscheidungsproblem: no algorithm decides validity of first-order logic statements. | CONNECTION: The Collatz map is a discrete dynamical system on integers — its orbit structure is *not* periodic in any simple modular sense. However, the *statistical* behavior of the map (when considering log2 of the orbit) converges toward a ratio: the expe
Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Related
- Collatz Conjecture and the Entscheidungsproblem: Parallels in Undecidability — 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{caldin2026undecidability,
title = {{Undecidability and the Collatz Conjecture: An Elementary Problem Beyond Axiomatic Proof — E8 Intelligence Research}},
author = {Andrew Stewart Caldin},
howpublished = {Zenodo},
year = {2026},
month = oct,
doi = {10.5281/zenodo.23465214},
url = {https://zenodo.org/records/23465214},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Undecidability and the Collatz Conjecture: An Elementary Problem Beyond Axiomatic Proof — E8 Intelligence Research
AU - Andrew Stewart Caldin
PY - 2026
DA - 2026/10/19
PB - Zenodo
DO - 10.5281/zenodo.23465214
UR - https://zenodo.org/records/23465214
AB - FINDING: The core mathematical insight is the existence of *undecidable* problems — problems whose truth is independent of any fixed axiomatic system (Gödel/Turing) — and the Collatz Conjecture as a concrete, elementary example of a problem with no known proof or disproof, whose behavior is computationally irreducible. | MATH: Collatz map: T(n) = n/2 if n even; T(n) = 3n+1 if n odd. Conjecture: ∀ n ∈ ℕ, ∃ k: T^k(n) = 1. No closed-form solution; no known invariant. Turing's halting problem: H(P,i) — no computable function decides if program P halts on input i. Hilbert's Entscheidungsproblem: no algorithm decides validity of first-order logic statements. | CONNECTION: The Collatz map is a discrete dynamical system on integers — its orbit structure is *not* periodic in any simple modular sense. However, the *statistical* behavior of the map (when considering log_2 of the orbit) converges toward a ratio: the expe Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
ER -