Computability, complexity, and languages: Fundamentals of theoretical computer science (Computer science and applied mathematics)

By Martin D. Davis, Elaine J. Weyuker, Ron Sigal

Book Overview

The take-it-with-you collecting resource? At last, a guide you can really carry along to estate sales, garage sales, and flea markets, containing 1,000 color photographs and current pricing to make on-the-spot appraisals easy. New to this edition! Feature chapters on Christmas stamps and Error stamps 1,000 detailed color photos Listings for all 4,250+ U.S. regular-issue and Airmail stamps from 1847-2010 Accurate prices in Unused and Used condition State-of-the-market report and advice on beginning a collection, including where to find stamps, judging quality, grading, and handling and storage

• Format: Hardcover
• Language: English
• ISBN: 0122063805
• ISBN13: 9780122063800
• Release Date: January 1983
• Publisher: Academic Press
• Length: 425 Pages
• Weight: 1.70 lbs.

Customer Reviews

Pure mathematical view of Computability and Complexity

This is not a common book on Computability and Complexity as Hopcroft-Ullman, Sipser or Papadimitrou. You won't find here too many words describing topics: you'll find the power and elegance of a superlative mathematical approach from one the best authors of the century in the field. Conversely, you'll find here a detailed and elegant treatment of the whole history of computational models that starts at the Primitive Recursive...

Beautiful overview

The authors of this book define theoretical computer science as the mathematical study of models of computation, and they do an excellent job of detailing the major results in the theory of computation as related to mathematical logic. Mathematicians, programmers, and philosophers will find the book an effective one in which to learn computability theory, and it serves well as a textbook for courses in the subject. After...

My favorite book on the theory of computation

I first learned computability from this book and I loved every minute of it. It has lots of material and is superbly written. In fact, I think the chapters on logic are the most painless way to learn that subject. There are many other books around on this subject, but this is the ultimate!

CS Theory at it's best

I haven't found a better book on the Theoretical foundations of Computer Science. However since this IS theory the text can be a bit cryptic. Still, I'd recomend this book to any PhD Candidate or full Professor. Even a lowly Master's student like myself could use it.

This is a wonderful text about the theory of computation.

It taught me how to think about the theory of computation. The exercises added to the second edition are a big improvement over the first editon.