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,1

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

Table of n, a(n) for n=0..63.

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

Crossrefs

Sequence in context: A286996 A044937 A025459 * A037822 A144600 A011686

Adjacent sequences: A079362 A079363 A079364 * A079366 A079367 A079368

Keyword

nonn,nice,cons,base,hard,more

Author

N. J. A. Sloane, Feb 15 2003

Status

approved