We specialize in hard to find items
All Categories
*Price and Stocks may change without prior notice
*Packaging of actual item may differ from photo shown
- Electrical items MAY be 110 volts.
- 7 Day Return Policy
- All products are genuine and original
About The Nature Of Computation
Review "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 "The Nature of Computation (TNoC) is a comprehensive, accessible, and highly enjoyable book that conveys the key intellectual contributions of the theory of computing. The project took off as an effort to present theoretical computer science to physicists, but it is equally suitable for any science graduate who is curious to explore beautiful and deep ideas related to the mathematical structure of problems. ... TNoC provides not just a window through which people from other disciplines can get glimpses of the interesting nuggets from computer science, but also provides an entertaining open house session where a visitor can meet various deep ideas and understand the core arguments behind key results." --Haris Aziz, SIGACT News Book Review Column"The book is highly recommended for all interested readers: in or out of courses, students undergraduate, researchers in other fields eager to learn the subject, or scholars already in the field who wish to enrich their current understanding. It makes for a great textbook in a conventional theory of computing course, as I can testify from recent personal experience (I used it once; I'll use it again!). With its broad and deep wealth of information, it would be a top contender for one of my "desert island" books. [The Nature of Computation] speaks directly, clearly, convincingly, and entertainingly, but also goes much further: it inspires." --Frederic Green, SIGACT News Book Review Column Product 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
