Algorithmic Information Theory
- Format
- Bog, paperback
- Engelsk
Normalpris
kr. 429,95
Medlemspris
kr. 399,95
- Du sparer kr. 30,00
- Fri fragt
-
Leveringstid: 7-13 Hverdage (Sendes fra fjernlager) Forventet levering: 10-03-2026
- Kan pakkes ind og sendes som gave
Beskrivelse
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.
Detaljer
- SprogEngelsk
- Sidetal192
- Udgivelsesdato02-12-2004
- ISBN139780521616041
- Forlag Cambridge University Press
- FormatPaperback
Størrelse og vægt
10 cm
Anmeldelser
Vær den første!
Log ind for at skrive en anmeldelse.