Algorithmic Information Theory

Prijzen vanaf
50,67

Uitgelicht

VERGELIJK ALLE AANBIEDERS (3)

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.

Vergelijk aanbieders (3)

Sorteren op:

€ 50,67 Gratis verzending

€ 50,67 Gratis verzending

€ 62,99 Gratis verzending

Beschrijving (1)

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.


Productspecificaties

Merk Cambridge University Press
EAN
  • 9780521616041
  • 9783540332183
  • 9783642069789
Maat


Prijshistorie

* Prijshistorie bevat geen data van Amazon, Amazon Marketplace.

Prijzen voor het laatst bijgewerkt op:

Uitgelichte Keuze
50,67
Naar shop