登入選單

返回Google圖書搜尋

Algorithmic Information Theory

Gregory. J. Chaitin

出版	Cambridge University Press, 2004-12-02
主題	Computers / Languages / GeneralMathematics / Discrete Mathematics
ISBN	05216160429780521616041
URL	http://books.google.com.hk/books?id=hpSkzgEACAAJ&hl=&source=gbs_api

註釋

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.