Elements of the Theory of Computation: Amazon.ca: Harry Lewis, Christos H. Papadimitriou: Books

Product Description

Book Description

Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation. The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

From the Back Cover

Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation. The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

Tag this product

(What's this?)

Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.

Customer Reviews

29 Reviews

5 star:		(8)
4 star:		(4)
3 star:		(2)
2 star:		(8)
1 star:		(7)

Average Customer Review

2.9 out of 5 stars (29 customer reviews)

Share your thoughts with other customers:

Create your own review

Most helpful customer reviews

2.0 out of 5 stars A reference at best, a textbook from hell, Jan 20 2004

By A Customer

This review is from: Elements of the Theory of Computation (Paperback)

I took a Theory of Computation class with Harry Lewis, one of the book's author this last semester at Harvard. Lewis may be a gifted professor, but if you are looking for a textbook, look for something else (Sipser would be a much better idea). It is impossible to learn from this book; the examples are too complex, the questions are outlandishly difficult. I got my A but it was not thanks to this book. Steer clear.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

5.0 out of 5 stars You'll love it or hate it., Sep 20 2003

By

Jason T (Canada) - See all my reviews

This review is from: Elements of the Theory of Computation (Paperback)

I discuss the first edition, I havent read the updated version. People have strong opinions about this classic book. Many students have it forced upon them for some class and they absolutely despise it. But a small number of people like me loved it, in fact its one of the best textbooks I own. To get through it you need to enjoy mathematics and careful, rigorous definitions and proofs- rather than viewing these things as pointless obscuring or pedantic arrogance. Engineering students tend to find the book tedious, boring, and too difficult. Some people are intimidated by the sheer volume of special notation used. But if you're inclined towards mathematics or theoretical work I think you'll enjoy the extra rigor and precision (compared to most computation theory books). There are a few rough spots in it but overall a great book that will give you the foundation to begin studying computational complexity theory, recursive function theory, or mathematical logic. Note that the 2cd edition has unfortunately removed the chapters on logic, and I've heard its a little watered down, so be careful choosing which one you want.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

5.0 out of 5 stars A classic text on the theory of computation., July 24 2003

By

James Arvo (Pasadena, CA USA) - See all my reviews
(REAL NAME)

This review is from: Elements of the Theory of Computation (Paperback)

Elements of the Theory of Computation, by Lewis and Papadimitriou, is something of a classic in the theory of computation. Of the many books I have used to teach the theory of computation, this is the one I have been most satisfied with. It covers all of the fundamental concepts one would expect in such a book (more on this below) but offers a bit more mathematical rigor than most other books I've seen on this topic. It also covers one topic that is rarely even mentioned in other textbooks: the composition of Turing machines.

The book begins with a brief introduction to the relevant discrete mathematics (such as set theory and cardinality) and proof techniques, then introduces the concepts of finite automata, regular expressions, and regular languages, describing their interrelationships. It proceeds to context-free languages, pushdown automata, parse trees, pumping lemmas, Turing machines, undecidability, computational complexity, and the theory of NP-completeness. (These are all standard topics.) Along the way, Lewis and Papadimitriou also introduce random access Turing machines and recursive functions, and do a nice job of explaining the halting problem and how this translates into undecidable problems involving grammars, various questions about Turing machines, and even two-dimensional tiling problems. All of these topics are covered with an appropriate mix of formalism and intuition.

Perhaps the feature I like best is the discussion of composing simple Turing machines to obtain more complex and interesting machines. The authors even introduce a convenient graphical notation for combining Turing machines and spell out specific rules for composition. While most authors are forced to immediately employ heuristics in reasoning about complex Turing machines (lest the notation become overwhelming), Lewis and Papadimitriou are able to keep the discussion more formal and structured by virtue of their Turing machine "schema". I believe this makes their arguments more rigorous and even easier to follow.

This is clearly one of the best books on the theory of computation. However, be aware that there have been very significant changes from the first edition, which was lengthier and more thorough. I confess that I actually prefer the first edition, as it contains nice sections on logic and predicate calculus (which have been removed from the 2nd edition), and is a bit more formal (albeit with some fairly awful notation). The 2nd edition is definitely crisper, with much cleaner notation; it is clearly more student-friendly, which was presumably the aim of the new edition.

If you wish to teach an introduction to theoretical computer science, or wish to learn it on your own, this would be a fine book to use. It's hard to go wrong with this classic.

Help other customers find the most helpful reviews

Was this review helpful to you? Yes No

Report abuse

Share your thoughts with other customers: Create your own review

› See all 29 customer reviews on Amazon.ca

Want to see more reviews on this item?

› Go to Amazon.com to see all 36 reviews 2.8 out of 5 stars

Most recent customer reviews

5.0 out of 5 stars Recommended for some...
Concerning the FIRST EDITION: (I haven't read the second edition but on flipping through it briefly it appeared, well, dumbed down) This is one of my favorite undergraduate... Read more

Published on Jun 8 2003

5.0 out of 5 stars Recommended for some...
Concerning the FIRST EDITION: (I haven't read the second edition but on flipping through it briefly it appeared watered down) One of the best undergraduate textbooks I had. Read more

Published on Jun 8 2003