|
Search: id:A079365
|
|
|
| A079365 |
|
Binary expansion of the Chaitin Omega number Omega_U. |
|
+0
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; cons; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
This is the halting probability of a certain universal Chaitin (self-delimiting Turing) machine U.
The full (infinite precision) number is random and noncomputable.
|
|
REFERENCES
|
C. C. Calude, M. J. Dinneen and C.-K. Shu, Computing a glimpse of randomness, Exper. Math., 11 (2002), 361-370.
|
|
LINKS
|
C. C. Calude, M. J. Dinneen and C.-K. Shu, Computing a glimpse of randomness, Exper. Math., 11 (2002), 361-370.
Eric Weisstein's World of Mathematics, Chaitin's Constant
|
|
CROSSREFS
|
Sequence in context: A103674 A044937 A025459 this_sequence A037822 A005088 A011686
Adjacent sequences: A079362 A079363 A079364 this_sequence A079366 A079367 A079368
|
|
KEYWORD
|
nonn,nice,cons,base,hard
|
|
AUTHOR
|
njas, Feb 15 2003
|
|
|
Search completed in 0.002 seconds
|
