Algorithmic Information Theory (Paperback)

Gregory J. Chaitin

ISBN 10: 0521616042 / ISBN 13: 9780521616041

Published by Cambridge University Press, Cambridge, 2004

About this Item

Paperback. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel'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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9780521616041

Bibliographic Details

• Title: Algorithmic Information Theory (Paperback)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2004
• Language: English
• ISBN 10: 0521616042
• ISBN 13: 9780521616041
• 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.