Algorithmic Information Theory

Paperback EN 2004 9780521616041
€ 81,23
Levertijd ongeveer 16 werkdagen
Gratis verzonden

Samenvatting

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.

Specificaties

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Managementboek Top 100

€ 81,23
Levertijd ongeveer 16 werkdagen
Gratis verzonden

Rubrieken

    Personen

      Trefwoorden

        Artikelen

          Algorithmic Information Theory