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

Chaitin, Gregory. J.

ISBN 10: 0521343062 / ISBN 13: 9780521343060

Editore: Cambridge University Press, 1987

Riguardo questo articolo

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_403248221

Dati bibliografici

Titolo: Algorithmic Information Theory (Cambridge ...

Casa editrice: Cambridge University Press

Data di pubblicazione: 1987

Legatura: Hardcover

Condizione: Good

Descrizione articolo

Riassunto:

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.

Descrizione del libro:

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.