|
||||||||||||||||||||||||||||||||||||||
|
2 Reviews
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
33 of 51 people found the following review helpful:
4.0 out of 5 stars
A message from the author
Hello, I'm Gregory Chaitin and I'm the author of Exploring 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...
Published on September 4, 2001 by G. J. Chaitin
|
 |
0 of 4 people found the following review helpful:
3.0 out of 5 stars
Just for LISP and randomness
The treatment of LISP and randomness is interesting. But it is deplorable the propagation of his inacceptable mesure of the complexity of a sequence as the size in bits of the minimum program that reproduces it. According to that, the complexity of the sequence of a polynomial of 10th degree is greater than the complexity of the...
Published 20 months ago by Ludovicus
|
|
Most Helpful First | Newest First
|
|
33 of 51 people found the following review helpful:
4.0 out of 5 stars
A message from the author,
By
This review is from: Exploring Randomness (Discrete Mathematics and Theoretical Computer Science) (Hardcover)
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
0 of 4 people found the following review helpful:
3.0 out of 5 stars
Just for LISP and randomness,
By Ludovicus (Beachwood, OH USA) - See all my reviews
Amazon Verified Purchase(What's this?)
This review is from: Exploring Randomness (Discrete Mathematics and Theoretical Computer Science) (Hardcover)
The treatment of LISP and randomness is interesting.
But it is deplorable the propagation of his inacceptable mesure of the complexity of a sequence as the size in bits of the minimum program that reproduces it. According to that, the complexity of the sequence of a polynomial of 10th degree is greater than the complexity of the sequence of prime numbers. The list of the coeficients of the polynomial needs more bits that the whole program for prime numbers. Ludovicus |
|
Most Helpful First | Newest First
|
|
Exploring Randomness (Discrete Mathematics and Theoretical Computer Science) by Gregory J. Chaitin (Hardcover - December 7, 2001)
$89.95 $74.50
In stock but may require an extra 1-2 days to process. | |
 
| ||
