Buch, Englisch, Band 1, 190 Seiten, Format (B × H): 189 mm x 246 mm, Gewicht: 383 g
Buch, Englisch, Band 1, 190 Seiten, Format (B × H): 189 mm x 246 mm, Gewicht: 383 g
Reihe: Cambridge Tracts in Theoretical Computer Science
ISBN: 978-0-521-61604-1
Verlag: Cambridge University Press
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
Weitere Infos & Material
Foreword; Preface; Figures; 1. Introduction; Part I. Formalisms for Computation: Register Machines, Exponential Diophantine Equations, and Pure LISP: 2. The arithmetization of register machines; 3. A version of Pure LISP; 4. The LISP interpreter EVAL; Part II. Program Size, Halting Probabilities, Randomness, and Metamathematics: 5. Conceptual development; 6. Program size; 7. Randomness; 8. Incompleteness; 9. Conclusion; Bibliography.
