Recognizing strong random reals

Review of Symbolic Logic 1 (1):56-63 (2008)
  Copy   BIBTEX

Abstract

1. Characterizing randomness. Consider a physical process that, if suitably idealized, generates an indefinite sequence of independent random bits. One such process might be radioactive decay of a lump of uranium whose mass is kept at just the level needed to ensure that the probability is one-half that no alpha particle is emitted in the nth microsecond of the experiment. Let us think of the bits as drawn from {0, 1} and denote the resulting sequence by x with coordinates x0, x1, . . .. Now wouldn’t it be odd if there were a computer program P with the following property?

Other Versions

No versions found

Analytics

Added to PP
2009-01-28

Downloads
149 (#286,281)

6 months
16 (#715,298)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Limiting recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.
Randomness Is Unpredictability.Antony Eagle - 2005 - British Journal for the Philosophy of Science 56 (4):749-790.

View all 8 references / Add more references