Book contents
II - Program Size, Halting Probabilities, Randomness, & Metamathematics
Published online by Cambridge University Press: 23 November 2009
Summary
Having done the bulk of the work necessary to encode the halting probability Ω as an exponential diophantine equation, we now turn to theory. In Chapter 5 we trace the evolution of the concepts of program-size complexity. In Chapter 6 we define these concepts formally and develop their basic properties. In Chapter 7 we study the notion of a random real and show that Ω is a random real. And in Chapter 8 we develop incompleteness theorems for random reals.
- Type
- Chapter
- Information
- Algorithmic Information Theory , pp. 91Publisher: Cambridge University PressPrint publication year: 1987