|
|
|
|
||
|
HELP | |
|
  $60.00 List price:
Used Hardcover
Ships in 1 to 3 days
More copies of this ISBN:Elements of the Theory of Computatio 2ND Editionby Harry R Lewis
Synopses & ReviewsPublisher Comments: 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. Book News Annotation:As with the 1973 edition, Lewis (computer science, Harvard U.) and
Papadamitriou (computer science, U. of California, Berkeley) provide
an undergraduate text introducing the classical and contemporary
theory of computation. While the treatment is mathematical, the
viewpoint is that of computer science. Taking into account the
generations of changes in computer science in the interim, their
treatment of Turing machines, algorithm analysis, NP-completeness,
and finite automata have been revised. Other topics covered are:
sets, relations, and languages; context-free languages;
undecidability; and computational complexity.
Annotation c. Book News, Inc., Portland, OR (booknews.com) Table of Contents1. Sets, Relations, and Languages.
2. Finite Automata.
3. Context-free Languages.
4. Turing Machines.
5. Undecidability.
6. Computational Complexity.
7. NP-completeness.
Index. What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Other books you might like
Related Aisles
| |||||||||
|
| ||||||||||
|
||||||||||
Don't Miss
