Recomienda este artículo a tus amigos:
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 2 de diciembre de 2004 |
| ISBN13 | 9780521616041 |
| Editores | Cambridge University Press |
| Páginas | 192 |
| Dimensiones | 247 × 189 × 11 mm · 383 g |
| Lengua | Inglés |
| Editor de series | Abramsky, S. |
| Editor de series | Aczel, P. H. |
| Editor de series | Bakker, J. W. de |
| Editor de series | Gurevich, Y. |
| Editor de series | Tucker, J. V. |
| Editor de series | Van Rijsbergen, C. J. |