- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
This title in other editions
Other titles in the Discrete Mathematics and Theoretical Computer Science series:
Exploring Randomness (Discrete Mathematics and Theoretical Computer Science)by Gregory J. Chaitin
Synopses & Reviews
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.'
This text presents the technical core of Gregory Chaitin's theory of program-size complexity, also known as algorithmic information theory. LISP is used to present the key algorithms.
"This book presents the technical core of Chaitin?s theory of program-size complexity, also known as algorithmic information theory. LISP is used to present the key algorithms and to enable computer users to interact with the author?s proofs and discover for themselves how they work."
Table of Contents
Introduction: Historical Introduction. What is LISP? Why do I like it? How to Program my Universal Turing Machine in LISP.- 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. The Basic Result on Relative Complexity.- Randomness: Theoretical Interlude - What is Randomness? My definitions. Proof that Martin-Löf Randomness is Equivalent to Martin-Löf Randomness. Proof that Solovay Randomness is Equivalent to Strong Chaitin Randomness.- Future Work: Extending AIT to the Size of Programs for Computing Infinite Sets and to Computations with Oracles. Postscript - Letter to a Young Reader.
What Our Readers Are Saying
Other books you might like
Computers and Internet » Artificial Intelligence » Robotics