Algorithmic Information Theory

Algorithmic Information Theory

by Gregory. J. Chaitin
     
 

ISBN-10: 0521616042

ISBN-13: 9780521616041

Pub. Date: 10/28/2004

Publisher: 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

Overview

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.

Product Details

ISBN-13:
9780521616041
Publisher:
Cambridge University Press
Publication date:
10/28/2004
Series:
Cambridge Tracts in Theoretical Computer Science Series
Pages:
190
Product dimensions:
6.85(w) x 9.72(h) x 0.39(d)

Table of Contents

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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >