- Home
- Books
- Machine Theory
- Algorithmic Information Theory
Algorithmic Information Theory
Availability: In stock
Regular Price
AED 270.00
Special Price
AED 256.50
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gdel'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.
Publisher Name | Cambridge University Press |
---|---|
Author Name | Hagendorf, Col |
Format | Audio |
Bisac Subject Major | COM |
Language | NG |
Isbn 10 | 0521616042 |
Isbn 13 | 9780521616041 |
Target Age Group | min:NA, max:NA |
Series | 0004069871 |
Dimensions | 00.96" H x 90.07" L x 44.00" W |
Page Count | 192 |
Write Your Own Review
Recommended Products