Algorithmic Information Theory
Book Details
Format
Paperback / Softback
Book Series
Cambridge Tracts in Theoretical Computer Science
ISBN-10
0521616042
ISBN-13
9780521616041
Publisher
Cambridge University Press
Imprint
Cambridge University Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Dec 2nd, 2004
Print length
192 Pages
Weight
364 grams
Dimensions
18.90 x 24.70 x 1.10 cms
Product Classification:
Mathematical logicMathematical theory of computation
Ksh 9,550.00
Manufactured on Demand
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
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.
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.
Get Algorithmic Information Theory by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has pages.
