Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World

From a leading computer scientist, a unifying theory that will revolutionize our understanding of how life evolves and learns.

How does life prosper in a complex and erratic world? While we know that nature follows patterns -- such as the law of gravity -- our everyday lives are beyond what known science can predict. We nevertheless muddle through even in the absence of theories of how to act. But how do we do it?

In Probably Approximately Correct, computer scientist Leslie Valiant presents a masterful synthesis of learning and evolution to show how both individually and collectively we not only survive, but prosper in a world as complex as our own. The key is probably approximately correct algorithms, a concept Valiant developed to explain how effective behavior can be learned. The model shows that pragmatically coping with a problem can provide a satisfactory solution in the absence of any theory of the problem. After all, finding a mate does not require a theory of mating. Valiant's theory reveals the shared computational nature of evolution and learning, and sheds light on perennial questions such as nature versus nurture and the limits of artificial intelligence.

Offering a powerful and elegant model that encompasses life's complexity, Probably Approximately Correct has profound implications for how we think about behavior, cognition, biological evolution, and the possibilities and limits of human and machine intelligence.

Author: Leslie Valiant
Publisher: Basic Books
Published: 11/14/2014
Pages: 208
Binding Type: Paperback
Weight: 0.45lbs
Size: 8.10h x 5.40w x 0.60d
ISBN13: 9780465060726
ISBN10: 0465060722
BISAC Categories:
- Computers | Computer Science
- Computers | Artificial Intelligence | General
- Computers | Programming | Algorithms

About the Author
Leslie Valiant is the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. He is a Fellow of the Royal Society and a member of the National Academy of Sciences. He is a winner of the Nevanlinna Prize from the International Mathematical Union, and the Turing Award, known as the Nobel of computing.