|
| |
|
|
A160753
|
|
Binary expansion of the Chaitin halting probability Omega_L for a certain programming language L.
|
|
0
| |
|
|
0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| If this sequence were extended to 5000 terms, it would settle the Riemann hypothesis.
|
|
|
REFERENCES
| C. S. Calude, E. Calude and M. J. Dinneen, A new measure of the difficulty of problems, J. Mult.-Valued Logic Soft. Comput., 12 (2006), 285-307.
C. S. Calude and G. J. Chaitin, What is a Halting Probability?, Notices Amer. Math. Soc., 57 (No. 2, 2010), 236-237.
C. S. Calude and M. J. Dinneen, Exact approximations of omega numbers, Internat. J. Bifur. Chaos, 17 (6) (2007), 1937-1954.
|
|
|
CROSSREFS
| Cf. A079365.
Sequence in context: A091247 A085137 A130543 * A024360 A025456 A024889
Adjacent sequences: A160750 A160751 A160752 * A160754 A160755 A160756
|
|
|
KEYWORD
| nonn,hard,more
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jan 29 2010
|
| |
|
|
