Algorithmic Information Theory

TRAMA

Expounds Godel's incompleteness theorey using an information theoretic approach based on the size of computer programs.

NOTE EDITORE

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.

SOMMARIO

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.

PREFAZIONE

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.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9780521616041
• Collana: Cambridge Tracts in Theoretical Computer Science
• Dimensioni: 246 x 20 x 188 mm Ø 345 gr
• Formato: Brossura
• Pagine Arabe: 192