Exploring Randomness (Discrete Mathematics and Theoretical Computer Science)


Product 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 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 (Discrete Mathematics and Theoretical Computer Science) Review
Hello, I'm Gregory Chaitin and I'm the author ofExploring RANDOMNESS, which is my attempt to explain
the technical heart of my theory of algorithmic
information as understandably as possible. To make
my theory more concrete, I've converted it into a
theory of the size in bits of real computer programs,
programs that you can actually run. See also my
new book, "Conversations with a Mathematician: Math,
Art, Science and the Limits of Reason", which is a
collection of my most wide-ranging and non-technical
lectures and interviews.---Gregory Chaitin, IBM Research
Division
Most of the consumer Reviews tell that the "Exploring Randomness (Discrete Mathematics and Theoretical Computer Science)" are high quality item. You can read each testimony from consumers to find out cons and pros from Exploring Randomness (Discrete Mathematics and Theoretical Computer Science) ...

No comments:
Post a Comment