Book contents
- Frontmatter
- Contents
- Foreword
- Preface
- Figures
- 1 Introduction
- I Formalisms for Computation: Register Machines, Exponential Diophantine Equations, & Pure LISP
- II Program Size, Halting Probabilities, Randomness, & Metamathematics
- 5 Conceptual Development
- 6 Program Size
- 7 Randomness
- 8 Incompleteness
- 9 Conclusion
- A Implementation Notes
- B The Number of S-expressions of Size N
- Bibliography
- Frontmatter
- Contents
- Foreword
- Preface
- Figures
- 1 Introduction
- I Formalisms for Computation: Register Machines, Exponential Diophantine Equations, & Pure LISP
- II Program Size, Halting Probabilities, Randomness, & Metamathematics
- 5 Conceptual Development
- 6 Program Size
- 7 Randomness
- 8 Incompleteness
- 9 Conclusion
- A Implementation Notes
- B The Number of S-expressions of Size N
- Bibliography
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511608858/resource/name/firstPage-9780511608858c7_p128-145_CBO.jpg)
- Type
- Chapter
- Information
- Algorithmic Information Theory , pp. 128 - 145Publisher: Cambridge University PressPrint publication year: 1987