Chaitin, the inventor of algorithmic information theory, presents
in this book the strongest possible version of Goedel'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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
