| Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)
(2004)
|
| Front Cover |
Book Details |
|
| Author |
| Gregory. J. Chaitin |
| Gregory J. Chaitin |
|
| Publication Date |
12/2/2004 |
| Format |
Paperback (244
x
188
mm)
|
| Publisher |
Cambridge University Press |
|
|
| Plot |
| 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. |
| Personal Details |
| Collection Status |
In Collection |
| Index |
83 |
| Read It |
Yes |
| Links |
Amazon US
Amazon UK
|
|
| Product Details |
| ISBN |
0521616042 |
| Cover Price |
$32.99 |
| Nr of Pages |
190 |
| First Edition |
No |
| Rare |
No |
|
|