A160753 Binary expansion of the Chaitin halting probability Omega_L for a certain programming language L.

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

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 M. J. Dinneen, Exact approximations of omega numbers, Internat. J. Bifur. Chaos, 17 (6) (2007), 1937-1954.

Links

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

C. S. Calude, E. Calude and M. J. Dinneen, A new measure of the difficulty of problems, CDMTCS Research Reports CDMTCS-277 (2006).

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, CDMTCS Research Reports CDMTCS-293 (2006).

Crossrefs

Cf. A079365.

Sequence in context: A281302 A369426 A340599 * A328981 A369070 A024360

Adjacent sequences: A160750 A160751 A160752 * A160754 A160755 A160756

Keyword

nonn,hard,more

Author

N. J. A. Sloane, Jan 29 2010

Status

approved