Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)

ISBN: 9780521616041

出版社: Cambridge University Press

出版年: 2004-12-02

页数: 192

定价: USD 43.00

装帧: Paperback

内容简介

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