Algorithmic Information Theory - Rilegato

Chaitin, Gregory. J.

Rilegato

ISBN 10: 0521343062 ISBN 13: 9780521343060

Casa editrice: Cambridge University Press, 1987

Riassunto

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.

Su questo libro

Descrizione del libro

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.

Contenuti

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.

Dettagli dell?edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 1987
• ISBN 10: 0521343062
• ISBN 13: 9780521343060
• Rilegatura: Copertina rigida
• Lingua: Inglese
• Numero di pagine: 192