The Nature of Computation
Price:
$90.00 (06)Description
Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, cryptography, and quantum computing are usually considered too "advanced" to show to the typical student. The aim of this book is to bridge both gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non computer scientists and to computer scientists who finally want to understand what their formalisms are actually telling.This book gives a lucid and playful explanation of the field, starting with P and NP-completeness. The authors explain why the P vs. NP problem is so fundamental, and why it is so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing.
At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduates and undergraduates, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.
Features
- An accessible introduction to computational complexity
- Many non-standard examples given
- Several structured problems (with solutions manual for teachers)
- Includes interdisciplinary topics like quantum computing, Monte Carlo algorithms and phase transitions
- Covers deep and recent results in theoretical computer science
- Authors are leaders in interdisciplinary work at the boundary between computer science and physics.
- Informal, enjoyable style
Reviews
"To put it bluntly: this book rocks! It's 900+ pages of awesome. It somehow manages to combine the fun of a popular book with the intellectual heft of a textbook, so much so that I don't know what to call it (but whatever the genre is, there needs to be more of it!)." -- Scott Aaronson, Massachusetts Institute of Technology
"A creative, insightful, and accessible introduction to the theory of computing, written with a keen eye toward the frontiers of the field and a vivid enthusiasm for the subject matter." -- Jon Kleinberg, Cornell University
"If you want to learn about complexity classes, scaling laws in computation, undecidability, randomized algorithms, how to prepare a dinner with Pommard, Quail and Roquefort, or the new ideas that quantum theory brings to computation, this is the right book. It offers a wonderful tour through many facets of computer science. It is precise and gets into details when necessary, but the main thread is always at hand, and entertaining anecdotes help to keep the pace." -- Marc Mezard, Universite de Paris Sud, Orsay
"A treasure trove of ideas, concepts and information on algorithms and complexity theory. Serious material presented in the most delightful manner!" -- Vijay Vazirani, Georgia Instituute of Technology
"A fantastic and unique book - a must-have guide to the theory of computation, for physicists and everyone else." -- Riccardo Zecchina, Politecnico di Torino
About the Author(s)
Cristopher Moore, Computer Science Department and Department of Physics and Astronomy, University of New Mexico, and External Professor, Santa Fe Institute, and Stephan Mertens, Institute of Theoretical Physics, Otto-von-Guericke University, Magdeburg, and External Professor, Santa Fe Institute
