Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)

Chaitin, Gregory. J.

ISBN 10: 0521343062 / ISBN 13: 9780521343060

Published by Cambridge University Press, 1987

About this Item

Used book in good condition. May have some wear to binding, spine, cover, and pages. Some light highlighting markings writing may be present. May have some stickers and or sticker residue present. May be Ex-lib. copy. May NOT include discs, or access code or other supplemental material. We ship Monday-Saturday and respond to inquiries within 24 hours.

Seller Inventory # BXM.96P5

Bibliographic Details

• Title: Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
• Publisher: Cambridge University Press
• Publication Date: 1987
• Language: English
• ISBN 10: 0521343062
• ISBN 13: 9780521343060
• Binding: Hardcover
• Condition: good

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.