Produkt
KlappentextChaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel'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.
Details
ISBN/GTIN978-0-521-61604-1
ProduktartBuch
EinbandartKartoniert, Paperback
Erscheinungsjahr2004
Erscheinungsdatum20.10.2004
Seiten192 Seiten
SpracheEnglisch
MasseBreite 189 mm, Höhe 246 mm, Dicke 11 mm
Gewicht383 g
Artikel-Nr.13860210
Rubriken