| Algorithmic Information Theory Contributor(s): Chaitin, Gregory J. (Author) |
|
 |
ISBN: 0521616042 ISBN-13: 9780521616041 Publisher: Cambridge University Press OUR PRICE: $59.84 Product Type: Paperback - Other Formats Published: December 2004 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Computers | Machine Theory - Computers | Programming Languages - General |
| Dewey: 006.31 |
| LCCN: 2005279337 |
| Series: Cambridge Tracts in Theoretical Computer Science (Paperback) |
| Physical Information: 0.41" H x 7.44" W x 9.69" (0.78 lbs) 192 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |