

A079365


Binary expansion of the Chaitin Omega number Omega_U.


5



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
(list;
constant;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

This is the halting probability of a certain universal Chaitin (selfdelimiting Turing) machine U.
The full (infinite precision) number is random and noncomputable.
The machine used is NOT universal, since each data bit is given in ASCII and contributes 7 bits to the program length. [From John Tromp, Mar 23 2009]


REFERENCES

G. J. Chaitin, THE LIMITS OF MATHEMATICS, SpringerVerlag London, 2003, http://www.umcs.maine.edu/~chaitin/inv.html [From 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), 361370.
Eric Weisstein's World of Mathematics, Chaitin's Constant


CROSSREFS

Sequence in context: A103674 A044937 A025459 * A037822 A144600 A005088
Adjacent sequences: A079362 A079363 A079364 * A079366 A079367 A079368


KEYWORD

nonn,nice,cons,base,hard


AUTHOR

N. J. A. Sloane, Feb 15 2003


STATUS

approved



