A Hardback edition by Gregory J. Chaitin in English (Jan 25, 2001)
$162.40 + FREE delivery
Last few at this price
Short Description: This essential companion to Chaitin's successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The two... Read more
This essential companion to Chaitin's successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The two previous volumes are more concerned with applications to meta-mathematics. LISP is used to present the key algorithms and to enable computer users to interact with the authors proofs and discover for themselves how they work. The LISP code for this book is available at the author's Web site together with a Java applet LISP interpreter. "No one has looked deeper and farther into the abyss of randomness and its role in mathematics than Greg Chaitin. This book tells you everything hes seen. Don miss it." John Casti, Santa Fe Institute, Author of Goedel: A Life of Logic.'
Exploring RANDOMNESS Hardback edition by Gregory J. Chaitin
- Gregory J. Chaitin
- Discrete Mathematics and Theoretical Computer Science
- Springer London Ltd
- Publication date
- Jan 25, 2001
- 1st ed 2001. Corr. 2nd printing 2001
- Product dimensions
- 159 x 234 x 19mm
I Introduction.- Historical introduction-A century of controversy over the foundations of mathematics.- What is LISP? Why do I like it?.- How to program my universal Turing machine in LISP.- II Program Size.- A self-delimiting Turing machine considered as a set of (program, output) pairs.- How to construct self-delimiting Turing machines: the Kraft inequality.- The connection between program-size complexity and algorithmic probability: H(x) = ? log2P(x) +O(1). Occam's razor: there are few minimum-size programs.- The basic result on relative complexity: H(y?x) = H(x,y)-H(x)+O(1).- III Randomness.- Theoretical interlude-What is randomness? My definitions.- Proof that Martin-Loef randomness is equivalent to Chaitin randomness.- Proof that Solovay randomness is equivalent to Martin-Loef randomness.- Proof that Solovay randomness is equivalent to strong Chaitin randomness.- IV Future Work.- Extending AIT to the size of programs for computing infinite sets and to computations with oracles.- Postscript-Letter to a daring young reader.