Jump to ratings and reviews
Rate this book
Rate this book
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.

Hardcover

First published October 15, 1987

3 people are currently reading
132 people want to read

About the author

Gregory Chaitin

23 books42 followers
Gregory Chaitin is widely known for his work on metamathematics and for his discovery of the celebrated Omega number, which proved the fundamental unknowability of math. He is the author of many books on mathematics, including Meta Math! The Quest for Omega. Proving Darwin is his first book on biology. Chaitin was for many years at the IBM Watson Research Center in New York. The research described in this book was carried out at the Federal University of Rio de Janeiro in Brazil, where Chaitin is now a professor. An Argentine-American, he is an honorary professor at the University of Buenos Aires and has an honorary doctorate from the National University of Cordoba, the oldest university in Argentina.

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
1 (3%)
4 stars
15 (57%)
3 stars
10 (38%)
2 stars
0 (0%)
1 star
0 (0%)
Displaying 1 - 3 of 3 reviews
Profile Image for Nick Black.
Author 2 books892 followers
Want to read
August 3, 2009
Hahha, I was telling someone the other day, "the thing about Chaitin is that every book I've read by him points out, not once but several times, that he thinks himself the third in a line going back through Turing to Gödel. This makes him not only the greatest living computer scientist, but the greatest computer scientist of all time, Turing being a mathematician and Gödel a logician. They (his books) can get very messianic at times, but without the humility we've associated since Golgotha with a Deliverer -- think of a very unhappy universe where Michio Kaku had written more than autohagiographic pop science balderdash and a forgettable quantum chromodynamics textbook. He'd want fucking statues set up, and seven comely maidens of virtue true each nine years." And what would be the one-line Amazon intro:
More than half a century has passed since the famous papers GÖDEL (1931) and TURING (1937) that shed so much light on the foundations of
I'd put a dollar on a self-mention within forty words from there.
Displaying 1 - 3 of 3 reviews

Can't find what you're looking for?

Get help and learn more about the design.