A079365 Binary expansion of a Chaitin Omega number Omega_U.

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0

Offset: 0

Author

N. J. A. Sloane, Feb 15 2003

Keywords

• nonn
• nice
• cons
• base
• hard
• more

Comments

This is the halting probability of a certain Chaitin (self-delimiting Turing) machine U.

The full (infinite precision) number is noncomputable.

The machine used is NOT universal, since each data bit is given in ASCII and contributes 7 bits to the program length. - John Tromp, Mar 23 2009

Links

• C. C. Calude, M. J. Dinneen and C.-K. Shu, Computing a glimpse of randomness, Exper. Math., 11 (2002), 361-370.
• G. J. Chaitin, An Invitation to Algorithmic Information Theory, DMTCS'96 Proceedings.
• Eric Weisstein's World of Mathematics, Chaitin's Constant
• Index entries for transcendental numbers