Algorithmic Information Theory

Klappentext Expounds G del's incompleteness theorey using an information theoretic approach based on the size of computer programs. Zusammenfassung 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. Inhaltsverzeichnis 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.

Détails du produit

• Auteurs: Gregory J. Chaitin, Gregory. J. Chaitin
• Collaboration: Samson Abramsky (Editeur), C. J. van Rijsbergen (Editeur), C. J. van Rijsbergen (Editeur)
• Edition: Cambridge University Press ELT
• Langues: Anglais
• Format d'édition: Livre de poche
• Sortie: 02.12.2004
• EAN: 9780521616041
• ISBN: 978-0-521-61604-1
• Pages: 192
• Thème: Cambridge Tracts in Theoretica
• Catégories: Livres de conseils; Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Informatique