$128.55
List price: 160.25
You save: $31.70
HARDCOVER, NEW
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
in 7 to 12 days
| Qty | Store | Section |
|---|---|---|
| 19 | Partner Warehouse | Computers Reference- General |
| Hide store locations | ||
Introduction To the Theory of Computation (2ND 06 Edition)
by Michael Sipser
|
|
|
About This Book
ISBN13: 9780534950972 
|
This item will ship separately from others in your shopping cart.
Synopses & Reviews
Publisher Comments:
This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.
Review:
"For the market this text addresses, Introduction to the Theory of Computation, Second Edition is an outstanding text without peer." - Christopher Wilson, University of Oregon
Synopsis:
Michael Sipser's emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own.
Synopsis:
This market leading text on computational theory provides a mathematical treatment of computer science theory designed around theorems and proofs.
About the Author
Dr. Sipser has been at MIT teaching and doing research in computational complexity theory for the past 24 years. He has published on a variety of areas, including circuit complexity, interactive proof systems, probabilistic computation and quantum computation. He enjoys lecturing, and has given courses ranging from freshman calculus to advanced seminars in complexity. In addition to MIT, he has held positions at the University of California/Berkeley and at IBM research.
Table of Contents
Introduction Part 1: Automata and Languages 1. Regular Languages 2. Context-Free Languages Part 2: Computability Theory 3. The Church-Turing Thesis 4. Decidability 5. Reducibility 6. Advanced Topics in Computability Theory Part 3: Complexity Theory 7. Time Complexity 8. Space Complexity 9. Intractability 10. Advanced Topics in Complexity Theory Selected Bibliography
What Our Readers Are Saying
Be the first to add a comment for a chance to win!
Product Details
- ISBN:
- 9780534950972
- Author:
- Publisher:
- Course Technology
- Subject:
- Computer Science
- Subject:
- Machine Theory
- Subject:
- Formal languages
- Subject:
- Computational complexity
- Copyright:
- 2006
- Edition Number:
- 2
- Publication Date:
- February 2005
- Binding:
- Hardcover
- Grade Level:
- College/higher education:
- Language:
- English
- Illustrations:
- Y
- Pages:
- 431
- Dimensions:
- 9.56x6.50x.91 in. 1.70 lbs.
