{"product_id":"algorithmic-information-theory-paperback-9780521616041","title":"Algorithmic Information Theory (Paperback) 9780521616041","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eAlgorithmic Information Theory\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eExpounds Gödel's incompleteness theorey using an information theoretic approach based on the size of computer programs.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eGregory. J. Chaitin (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521616041, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback, published 2 December 2004\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e192 pages\u003cbr\u003e24.6 x 18.8 x 2 cm, 0.345 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eChaitin, 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eForeword\u003cbr\u003e Preface\u003cbr\u003e Figures\u003cbr\u003e 1. Introduction\u003cbr\u003e Part I. Formalisms for Computation: Register Machines, Exponential Diophantine Equations, and Pure LISP: 2. The arithmetization of register machines\u003cbr\u003e 3. A version of Pure LISP\u003cbr\u003e 4. The LISP interpreter EVAL\u003cbr\u003e Part II. Program Size, Halting Probabilities, Randomness, and Metamathematics: 5. Conceptual development\u003cbr\u003e 6. Program size\u003cbr\u003e 7. Randomness\u003cbr\u003e 8. Incompleteness\u003cbr\u003e 9. Conclusion\u003cbr\u003e Bibliography.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46004623835416,"sku":"9780521616041","price":43.79,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521616041i_2133f7c4-2506-484b-9045-e2bae71c93c7.jpg?v=1691370567","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/algorithmic-information-theory-paperback-9780521616041","provider":"Freshly Printed Books","version":"1.0","type":"link"}