Gregory. J. Chaitin
Cambridge University Press
e druk, 2004
9780521616041
Algorithmic Information Theory
Specificaties
Paperback, 192 blz.
|
Engels
Cambridge University Press |
e druk, 2004
ISBN13: 9780521616041
Rubricering
Onderdeel van serie
Cambridge Tracts in
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9780521616041
Taal:Engels
Bindwijze:Paperback
Aantal pagina's:192
Uitgever:Cambridge University Press
Serie:Cambridge Tracts in
Inhoudsopgave
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.