Algorithmic Information Theory
Prijzen vanaf
VERGELIJK ALLE AANBIEDERS
(3)
Bol
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.
Lees meer
61,86
Uitgelicht
|
61,86 |
Naar shop
|
|
61,86 |
Naar shop
|
|
62,99 |
Naar shop
|
Beschrijving
Bol
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.
Beschrijving
(2)
Bol
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.
AmazonPagina's: 192, Paperback, Cambridge University Press
Productspecificaties
| Merk | Cambridge University Press |
|---|---|
| EAN |
|
| Maat |
|
Prijzen voor het laatst bijgewerkt op:
Gerelateerde producten
Uitgelichte Keuze
61,86
