Copyright ©1998-2010 Glenn Fleishman. Send in your comments. Bibliographic information on isbn.nu licensed from Baker & Taylor. Contact them for corrections and licensing, or read more about our data.
Algorithmic Information Theory
Descriptions of each edition are found in brief where available. Click details & prices to get more information on a book or to find the best prices for the title.
Hardcover
from Cambridge Univ Pr (November 1, 1987)
9780521343060 | details & prices | 7.25 × 10.00 × 0.75 in. | 1.15 lbs | List price $73.99
About: 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.
About: 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.
Paperback
from Cambridge Univ Pr (December 2, 2004)
9780521616041 | details & prices | 175 pages | 7.50 × 9.75 × 0.50 in. | 0.78 lbs | List price $46.00
About: 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.
About: 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.