Tell your friends about this item:
Algorithmic Information Theory - Cambridge Tracts in Theoretical Computer Science Gregory. J. Chaitin
Algorithmic Information Theory - Cambridge Tracts in Theoretical Computer Science
Gregory. J. Chaitin
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.
192 pages, black & white illustrations
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | December 2, 2004 |
| ISBN13 | 9780521616041 |
| Publishers | Cambridge University Press |
| Pages | 192 |
| Dimensions | 247 × 189 × 11 mm · 383 g |
| Language | English |
| Series Editor | Abramsky, S. |
| Series Editor | Aczel, P. H. |
| Series Editor | Bakker, J. W. de |
| Series Editor | Gurevich, Y. |
| Series Editor | Tucker, J. V. |
| Series Editor | Van Rijsbergen, C. J. |