false 852501 2 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. 838005 30 10 1987 Algorithmic Information Theory total:3|4:1|3:2| 3 10 9 3 0 0 false false Sun Aug 02 23:56:47 -0700 2009 Mon Aug 03 00:11:53 -0700 2009 more...]]> 0 0 false false Fri May 01 02:21:09 -0700 2009 Fri May 01 02:27:16 -0700 2009 inaugural post.more...]]> 4 0 false false Fri Dec 19 00:00:00 -0800 2008 Fri Dec 19 08:39:57 -0800 2008 Fri Dec 19 11:08:12 -0800 2008 http://blog.fogus.me/2008/12/19/bookpr0n...

-m
]]> 0 0 false false Sun Aug 16 12:31:50 -0700 2009 Sun Aug 16 12:31:50 -0700 2009 0 0 false false Sat Jul 04 01:18:11 -0700 2009 Sat Jul 04 01:18:40 -0700 2009 3 0 false false Sat Apr 11 10:47:36 -0700 2009 Sat Apr 11 10:47:36 -0700 2009 0 0 false false Sun May 04 13:49:15 -0700 2008 Sun May 04 13:49:15 -0700 2008 3 0 false false Sun Dec 23 09:39:43 -0800 2007 Sun Dec 23 09:39:43 -0800 2007 0 0 false false Fri Oct 19 23:12:40 -0700 2007 Fri Oct 19 23:12:40 -0700 2007