What question did this study set out to answer?

The aim is to demonstrate that Chaitin's Omega reveals insights about randomness and unprovable mathematical truths.

July 22, 2026Open Access

Chaitin's Omega: Uncomputable Halting Probability Reveals Randomness in Arithmetic — E8 Intelligence Research

Key Points

The aim is to demonstrate that Chaitin's Omega reveals insights about randomness and unprovable mathematical truths.
Defined Chaitin's Omega as a sum over halting programs, establishing its properties.
Showed that Omega is normal in base 2 and uncomputable.
Explored the connection between Omega's distribution and dynamics in homogeneous spaces.
Chaitin's Omega is algorithmically random with maximal Kolmogorov complexity.
No finite axiomatic system can prove more than finitely many bits of Omega.
The binary digits of Omega exhibit equidistribution similar to uniform distributions on a circle.

Abstract

FINDING: Chaitin's Omega is an algorithmically random real number encoding the halting probability of a universal Turing machine, proving that some mathematical truths are unprovable and that randomness exists in arithmetic. MATH: - Ω = Σ₏ ₇₀₋ₓₒ 2^-|p|, where |p| is the length of program p in bits. - Ω is normal in base 2 (each binary string of length n appears with asymptotic frequency 2^-n). - Ω is uncomputable: no finite algorithm can output its binary expansion. - Ω is algorithmically random: its Kolmogorov complexity is maximal (≈ its length). - No finite axiomatic system can prove more than finitely many bits of Ω. CONNECTION: - The base-2 equidistribution of Ω's binary digits mirrors the uniform distribution of points on a circle (angle 2π × binary fraction). This ties to equidistribution on the 1-torus, a foundational case for homogeneous space dynamics. - The halting probability sum over programs of length |p| uses powers of 1/2, reminiscent of dyadic ra Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence. com

Ask AI

Helpful

Bookmark

View Full Paper