Introduction to the Theory of Computation (Hardcover)

~ (Author)

Editorial Reviews

Amazon.com Review

"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.

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 --This text refers to an alternate Hardcover edition.

See all Editorial Reviews

Product Details

• Hardcover: 416 pages
• Publisher: PWS Pub. Co.; 1 edition (December 13, 1996)
• Language: English
• ISBN-10: 053494728X
• ISBN-13: 978-0534947286
• Product Dimensions: 9.5 x 6.3 x 0.8 inches
• Shipping Weight: 1.6 pounds
• Average Customer Review: 4.5 out of 5 stars  See all reviews (54 customer reviews)
• Amazon.com Sales Rank: #249,229 in Books (See Bestsellers in Books)

  Popular in these categories: (What's this?)

  #30 in	Books > Computers & Internet > Computer Science > Artificial Intelligence > Machine Learning
  #64 in	Books > Science > Mathematics > Pure Mathematics > Discrete Mathematics
  #66 in	Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Discrete Mathematics

Customer Reviews

Most Helpful Customer Reviews

67 of 67 people found the following review helpful:

5.0 out of 5 stars Absolutely Amazing, July 18, 2001

By	A. Scudiero (Minneapolis, MN United States) - See all my reviews (REAL NAME)

When I picked up this book I thought, "You have to be kidding me." This book is very thin, and then a fair chunk of it is mathematics review for some of the formal arguments the book is going to be making later on. One wouldn't think there was much in this book.

One would be wrong. This book goes into rather impressive depth on some rather abstract concepts of computer science without dabbling for too long in the details. It does the best job I've ever seen of explaining the Turing machine and how it relates to computability and decidablity.

The exercises are both easy and insanely difficult - so you can basically chose your level and then go through the book, some of the problems are very hard, some are trivially easy, a great mix makes for great homework assignments.

The "Proof Idea:" sections before every proof give you the underlying concepts in plain english that are about to be stated formally so you have a clue what's happening when the formal definitions start flying. These are priceless and should be included in every other book that uses formal proof techniques.

The book reads fairly well on its own, or makes for a great class text book, which I used it for. As my professor said, "This is a good book because it doesn't have any extra words." but you don't seem to mind as you read it. Probably the best work on the science of computation in the world, certainly the best I've ever seen.

59 of 63 people found the following review helpful:

4.0 out of 5 stars Makes the study of Formal Langs amenable to bedtime reading!, August 13, 2000

By	Ramon Kranzkuper (Gainesville, FL) - See all my reviews

Summary of this review: You'll find yourself getting interested in, and understanding, concepts, very easily, but if you're an advanced reader you'll often find (at the end of the chapters) that the more advanced topics/problems have been glossed over.

If this is your assigned course textbook, you're lucky. If this is NOT your assigned textbook, USE it as your guide. It makes topics simpler and more intuitive. The way Sipser ropes down exotic theorems into straightforward, understandable logic is almost magical. The book scores in most areas: smoothness of flow, ease of understanding, order of presentation, motivational cues, and thoroughness in the areas covered.

The problem with the book is in the number of topics covered, and in the number of examples. There are not sufficient examples in some cases, and not sufficient material in some cases. This is a small textbook. At the end of each chapter, Sipser often glosses over the more advanced issues. If doing a thorough study, one will frequently need a more complete reference.

This will, of course, not be a problem if your course does not go beyond what is covered here: Finite Automata, Turing Machines, the relationship between the classes of languages, reducibility, and complexity theory.

47 of 50 people found the following review helpful:

5.0 out of 5 stars a lifesaver for all computer science majors!, December 30, 1999

By A Customer

I bought this book in a desperate attempt to pass a Theory of Computation course in which I was enrolled. I was stuck in the sad situation of having a non-English speaking, difficult to understand professor. In addition, the required text for the course was awful. Thanks to Sipser's book, I not only avoided dropping the course, but managed to get an A. (I'm not exagerating). Sipser's book is fantastic compared to others on the subject. It is written in easy to understand, plain, no-nonsense language. (Even the section on pumping lemma is understandable) I became aware of Sipser's book as a result of reading a customer's negative review of another (more expensive) book (Intro to Languages & theory of Computation by J. Martin) on the same subject. The reviewer suggested buying this book by Sipser instead, and that advice was excellent. (Many thanks to that reader, whoever you are!) If you are considering heading for the drop course line at the registrar's office, try this book before you give up and quit!