|
%I #31 Jan 06 2024 09:20:14
%S 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,
%T 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
%N Binary expansion of a Chaitin Omega number Omega_U.
%C This is the halting probability of a certain Chaitin (self-delimiting Turing) machine U.
%C The full (infinite precision) number is noncomputable.
%C 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
%H C. C. Calude, M. J. Dinneen and C.-K. Shu, <a href="https://www.emis.de/journals/EM/expmath/volumes/11/11.3/Calude361_370.pdf">Computing a glimpse of randomness</a>, Exper. Math., 11 (2002), 361-370.
%H G. J. Chaitin, <a href="https://web.archive.org/web/20110520024301/http://www.umcs.maine.edu/~chaitin/inv.html">An Invitation to Algorithmic Information Theory</a>, DMTCS'96 Proceedings.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ChaitinsConstant.html">Chaitin's Constant</a>
%H <a href="/index/Tra#transcendental">Index entries for transcendental numbers</a>
%K nonn,nice,cons,base,hard,more
%O 0,1
%A _N. J. A. Sloane_, Feb 15 2003
|
