The Twin Impossibility: Collatz and the Halting Problem — E8 Intelligence Research

{"FINDING:":[0],"Collatz":[1,82],"Conjecture":[2],"and":[3,140],"the":[4,8,92,97,112,132,170],"Halting":[5,50,108],"Problem":[6],"are":[7,121,148],"two":[9],"canonical":[10],"\\"impossible\\"":[11],"problems":[12],"—":[13,20,66,100,146],"one":[14,17],"for":[15,18,45],"humans,":[16],"computers":[19],"revealing":[21],"a":[22,87,103],"fundamental":[23],"boundary":[24],"of":[25,89,96,114,169],"algorithmic":[26],"mathematics.":[27],"|":[28,79,143],"MATH:":[29],"Collatz:":[30],"f(n)":[31],"=":[32],"n/2":[33],"if":[34,38],"n":[35,39,47],"even,":[36],"3n+1":[37,84],"odd;":[40],"conjectured":[41],"to":[42,72],"reach":[43],"1":[44],"all":[46],"∈":[48],"ℕ⁺.":[49],"Problem:":[51],"no":[52],"Turing":[53],"machine":[54],"H":[55],"can":[56],"decide":[57],"whether":[58],"arbitrary":[59],"program":[60],"P":[61],"halts":[62],"on":[63],"input":[64],"I":[65],"proof":[67],"via":[68],"diagonalization":[69],"(H(P,I)":[70],"leads":[71],"contradiction":[73],"when":[74],"fed":[75],"its":[76],"own":[77],"negation).":[78],"CONNECTION:":[80],"The":[81,107],"map's":[83],"operation":[85],"introduces":[86],"factor":[88],"3,":[90],"breaking":[91],"pure":[93],"2-adic":[94],"symmetry":[95],"even/odd":[98],"partition":[99],"this":[101],"is":[102,134],"broken":[104],"Z/2":[105],"symmetry.":[106],"Problem's":[109],"undecidability":[110],"mirrors":[111],"non-constructibility":[113],"certain":[115],"roots":[116],"in":[117],"Galois":[118],"theory":[119],"(both":[120],"\\"no":[122],"finite":[123],"algorithm\\"":[124],"results).":[125],"No":[126],"direct":[127],"golden-ratio":[128],"or":[129,159],"base-60":[130],"link;":[131],"structure":[133],"more":[135],"about":[136],"discrete":[137],"dynamical":[138],"systems":[139],"recursion":[141],"theory.":[142],"DEPTH:":[144],"7":[145],"These":[147],"foundational":[149],"limits,":[150],"but":[151],"they":[152],"do":[153],"not":[154],"directly":[155],"reveal":[156],"new":[157],"constants":[158],"geometric":[160],"Author:":[161],"Andrew":[162],"Stewart":[163],"Caldin,":[164],"Independent":[165],"Researcher,":[166],"UK.":[167],"Part":[168],"E8":[171],"Intelligence":[172],"Research":[173],"series.":[174],"Platform:":[175],"e8intelligence.com":[176]}

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-18
DOI
https://doi.org/10.5281/zenodo.22824060
Primary Topic
Benford’s Law and Fraud Detection
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

The Twin Impossibility: Collatz and the Halting Problem — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
preprint

The Twin Impossibility: Collatz and the Halting Problem — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: Collatz Conjecture and the Halting Problem are the two canonical "impossible" problems — one for humans, one for computers — revealing a fundamental boundary of algorithmic mathematics. | MATH: Collatz: f(n) = n/2 if n even, 3n+1 if n odd; conjectured to reach 1 for all n ∈ ℕ⁺. Halting Problem: no Turing machine H can decide whether arbitrary program P halts on input I — proof via diagonalization (H(P,I) leads to contradiction when fed its own negation). | CONNECTION: The Collatz map's 3n+1 operation introduces a factor of 3, breaking the pure 2-adic symmetry of the even/odd partition — this is a broken Z/2 symmetry. The Halting Problem's undecidability mirrors the non-constructibility of certain roots in Galois theory (both are "no finite algorithm" results). No direct golden-ratio or base-60 link; the structure is more about discrete dynamical systems and recursion theory. | DEPTH: 7 — These are foundational limits, but they do not directly reveal new constants or geometric Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Benford’s Law and Fraud Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.