Del 1 - Cambridge Tracts in Theoretical Computer Science
Algorithmic Information Theory
Häftad, Engelska, 2004
Av Gregory. J. Chaitin, Gregory J. Chaitin, C. J. Van Rijsbergen, C. J. van Rijsbergen, Samson Abramsky
839 kr
Beställningsvara. Skickas inom 7-10 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.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.
Produktinformation
- Utgivningsdatum2004-12-02
- Mått188 x 246 x 20 mm
- Vikt345 g
- FormatHäftad
- SpråkEngelska
- SerieCambridge Tracts in Theoretical Computer Science
- Antal sidor192
- FörlagCambridge University Press
- ISBN9780521616041