Abstract
A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computable, increasing, converging sequence of rationals) and random (its binary expansion is an algorithmic random sequence). In particular, every Omega number is strongly noncomputable. The aim of this paper is to describe a procedure, that combines Java programming and mathematical proofs, to compute the exact values of the first 64 bits of a Chaitin Omega:
![](/cms/asset/cce6cff5-f830-4026-9a85-08c6a3719b7f/uexm_a_10504481_o_uf0001.gif)
Full description of programs and proofs will be given elsewhere.