| Title:
|
ALGORITHMIC INFORMATION THEORY
|
| By: |
Gregory J. Chaitin, C. J. Van Rijsbergen, S. Abramsky |
| Format: |
Paperback |
| List price:
|
£47.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0521616042 |
| ISBN 13: |
9780521616041 |
| Publisher: |
CAMBRIDGE UNIVERSITY PRESS |
| Pub. date: |
20 October, 2004 |
| Series: |
Cambridge Tracts in Theoretical Computer Science No. 1 |
| Pages: |
192 |
| Description: |
Expounds Godel's incompleteness theorey using an information theoretic approach based on the size of computer programs. |
| Synopsis: |
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Godel'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. |
| Publication: |
UK |
| Imprint: |
Cambridge University Press |
| Returns: |
Returnable |