Chaitin's Omega: Uncomputable Randomness in Babylonian Base-60 — E8 Intelligence Research
FINDING: Chaitin's Omega is a real number encoding the halting probability of random programs, proving that mathematical truth is irreducibly random and uncomputable. MATH: Ω = Σ_{p halts} 2^{-|p|}, where |p| is program length in bits; Ω is a normal, algorithmically random number in [0,1]. CONNECTION: Base-60 (sexagesimal) from Babylonian mathematics provides a natural representation for Ω's digits—60 is a highly composite number (2²·3·5), enabling exact fractions and cyclic patterns; Ω's randomness contrasts with the periodic, rational structure of base-60 fractions. DEPTH: 9 FINDING: Babylonian sexagesimal system (base-60) enabled precise computation of reciprocals, squares, and Pythagorean triples (Plimpton 322), predating Greek geometry by millennia. MATH: 60 = 2²·3·5; reciprocal pairs (e.g., 2:30, 3:20, 4:15, 5:12, 6:10) generate exact sexagesimal fractions; Plimpton 322 lists (a,b,c) satisfying a² + b² = c² in base-60. CONNECTION: Base-60 fractions map to regular pol Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Authors
- Andrew Stewart Caldin
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-08-20
- DOI
- https://doi.org/10.5281/zenodo.22022482
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- preprint