Search for a Book
HELP US TO HELP YOU Add a new Book


Algorithmic Information Theory

Description 
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 socalled exponential diophantine equation. 

Similar Books 



Home  Authors  About  Contact Us  Email
Copyright © 20022013 FreeScience.info.
Best viewed with Mozilla 1.X 1024x768
free scientific books
