The Nature of Computation

“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 Mézard, Université 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

Cristopher Moore is a Professor in the Computer Science Department and the Department of Physics and Astronomy, University of New Mexico, Albuquerque, and a Professor at the Santa Fe Institute
Stephan Mertens is a Professor at the Institute for Theoretical Physics, Otto-von-Guericke University, Magdeburg, and External Professor at the Santa Fe Institute

Cristopher Mooregraduated from Northwestern University with honors in 1986, at the age of 18, with a B.A. in Mathematics, Physics, and Integrated Science. He received his Ph.D. in Physics from Cornell University at the age of 23. After a postdoc at the Santa Fe Institute, he joined the faculty of the University of New Mexico, where he holds joint appointments in Computer Science and Physics and Astronomy. He has written over 90 papers, on topics ranging from undecidability in dynamical systems, to quantum computing, to phase transitions in NP-complete problems, to the analysis of social and biological networks.

Stephan Mertensgot his Diploma in Physics in 1989, and his Ph.D. in Physics in 1991, both from Georg-August University Göttingen. He holds scholarships from the “Studienstiftung des Deutschen Volkes”, Germany’s most prestigious organisation sponsoring the academically gifted. After his Ph.D. he worked for three years in the software industry before he joined the faculty of Otto-von-Guericke University Magdeburg as a theoretical physicist. His research focuses on disordered systems in statistical mechanics, average case complexity of algorithms, and parallel computing.