Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)

Gregory. J. Chaitin

ISBN 10: 0521616042 / ISBN 13: 9780521616041

Published by Cambridge University Press 2008-08-21, 2008

About this Item

Seller Inventory # 6666-IUK-9780521616041

Bibliographic Details

Title: Algorithmic Information Theory (Cambridge ...

Publisher: Cambridge University Press 2008-08-21

Publication Date: 2008

Binding: Paperback

Condition: New

About this title

Synopsis:

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.

Book 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.