Home › Computers & Technology › Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
  • No Image Available
1 1

Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)

hardcover – October 30, 1987
by Chaitin, Gregory. J.
$227.14 USD
$227.14 USD
Sale Sold out
Shipping calculated at checkout.
Secure Checkout
Quality Guaranteed
New In Stock
ISBN-13: 9780521343060 ISBN-10: 0521343062
Publisher
Cambridge University Press
Binding
hardcover
Published
October 30, 1987
Weight
1.1 lbs
Dimensions
25.40×1.90×18.40 cm

About this book

Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1) by Chaitin, Gregory. J.. hardcover edition. ISBN: 9780521343060.

Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödels 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.