Current Science

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


What does it mean to say that a fixed infinite string is random? In this article we will attempt to trace the history of this question and the fundamental role of computability theory in our understanding of randomness. In particular, we will describe Turing's observations on the notion of normal numbers and their construction and how that connects up with algorithmic randomness.

Keywords

Algorithmic Randomness, Computability Theory, Infinite String, Normal Numbers.
User
Notifications
Font Size