Undecidable Truths: The Collatz Conjecture and Gödel's Limits — E8 Intelligence Research
- 1Independent Researcher, United Kingdom
Abstract
FINDING: The core mathematical insight is the existence of *undecidable* problems — statements that are true but unprovable within any consistent formal system, and the Collatz Conjecture as a candidate for such a problem (though not yet proven undecidable). | MATH: Collatz map: T(n) = n/2 if n even, T(n) = 3n+1 if n odd. Conjecture: ∀ n ∈ ℕ, ∃ k: Tk(n) = 1. Undecidability: Gödel's incompleteness — no finite axiom system can decide all arithmetical truths. Turing's halting problem: no algorithm exists to decide if an arbitrary program halts — formalized as nexists H: ∀ (P,x), H(P,x) ∈ {0,1} correctly. | CONNECTION: The Collatz map's structure is *not* geometric — it is purely arithmetic (mod 2). However, the *space* of all possible trajectories forms a binary tree (each odd n has two preimages: 2n and (n−1)/3 if integer), which is a rooted tree with branching ratio 2:1 — a discrete analogue of a se
Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Related
- Clickbait Dominates Search Results; Only Unsolved Math Found Is Collatz Conjecture — E8 Intelligence Research
- Undecidability and the Collatz Conjecture: An Elementary Problem Beyond Axiomatic Proof — E8 Intelligence Research
- Modular Automorphic Proof of the Collatz Conjecture via Information-Loss Cascades — E8 Intelligence Research
- Collatz Conjecture Recast as Modular Tree Dynamics — E8 Intelligence Research
- Collatz Conjecture: Expository Sources Confirm No New Proof, Only Tao's 2019 Result — E8 Intelligence Research
BibTeX
@misc{caldin2026undecidable,
title = {{Undecidable Truths: The Collatz Conjecture and Gödel's Limits — E8 Intelligence Research}},
author = {Andrew Stewart Caldin},
howpublished = {Zenodo},
year = {2026},
month = oct,
doi = {10.5281/zenodo.23616550},
url = {https://zenodo.org/records/23616550},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Undecidable Truths: The Collatz Conjecture and Gödel's Limits — E8 Intelligence Research
AU - Andrew Stewart Caldin
PY - 2026
DA - 2026/10/24
PB - Zenodo
DO - 10.5281/zenodo.23616550
UR - https://zenodo.org/records/23616550
AB - FINDING: The core mathematical insight is the existence of *undecidable* problems — statements that are true but unprovable within any consistent formal system, and the Collatz Conjecture as a candidate for such a problem (though not yet proven undecidable). | MATH: Collatz map: T(n) = n/2 if n even, T(n) = 3n+1 if n odd. Conjecture: ∀ n ∈ ℕ, ∃ k: T^k(n) = 1. Undecidability: Gödel's incompleteness — no finite axiom system can decide all arithmetical truths. Turing's halting problem: no algorithm exists to decide if an arbitrary program halts — formalized as nexists H: ∀ (P,x), H(P,x) ∈ {0,1} correctly. | CONNECTION: The Collatz map's structure is *not* geometric — it is purely arithmetic (mod 2). However, the *space* of all possible trajectories forms a binary tree (each odd n has two preimages: 2n and (n−1)/3 if integer), which is a rooted tree with branching ratio 2:1 — a discrete analogue of a se Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
ER -