Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1) - Tapa dura

Libro 25 de 40: Cambridge Tracts in Theoretical Computer Science

Chaitin, Gregory. J.

 
9780521343060: Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Tapa dura
ISBN 10: 0521343062 ISBN 13: 9780521343060
Editorial: Cambridge University Press, 1987

Sinopsis

Expounds Gödel's incompleteness theorey using an information theoretic approach based on the size of computer programs.

"Sinopsis" puede pertenecer a otra edición de este libro.

Críticas

"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Cambridge University Press
Año de publicación
1987
Idioma
Inglés
ISBN 10 
0521343062
ISBN 13 
9780521343060
Encuadernación
Tapa dura
Número de páginas
192
Contacto del fabricante
no disponible
Persona responsable
Avery
https://www.avery.fr/

chemin des peupliers 27
Dardilly
Francia

Otras ediciones populares con el mismo título

9780521616041: Algorithmic Information Theory: 1 (Cambridge Tracts in Theoretical Computer Science, Series Number 1)

Edición Destacada

ISBN 10:  0521616042 ISBN 13:  9780521616041
Editorial: Cambridge University Press, 2008
Tapa blanda