Introduction to the Theory of Computation 1st Edition

by Michael Sipser (Author)

54 customer reviews

ISBN-13: 978-0534947286

ISBN-10: 053494728X

Why is ISBN important?

Have one to sell? Sell on Amazon

Share

Buy used

$14.97

Condition: Used - Good

In Stock. Sold by H and H Distributors, Fulfilled by Amazon

Access codes and supplements are not guaranteed with used items.

79 Used from $4.97

FREE Shipping on orders over $25.

Turn on 1-Click ordering

More Buying Choices

24 New from $15.00 79 Used from $4.97 1 Collectible from $24.99

104 used & new from $4.97

See All Buying Options

There is a newer edition of this item:

Introduction to the Theory of Computation

Introduction to the Theory of Computation
$232.32
(82)
In Stock.

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His 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 - a noted authority on the theory of computation - 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. INTRODUCTION TO THE THEORY OF COMPUTATION provides a mathematical treatment of computation theory grounded in theorems and proofs. Proofs are presented with a "proof idea" component to reveal the concepts underpinning the formalism. Algorithms are presented using prose instead of pseudocode to focus attention on the algorithms themselves, rather than on specific computational models. Topic coverage, terminology, and order of presentation are traditional for an upper-level course in computer science theory. Users of the Preliminary Edition (now out of print) will be interested to note several new chapters on complexity theory: Chapter 8 on space complexity; Chapter 9 on provable intractability, and Chapter 10 on advanced topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing.

Introduction to the Theory of Computation

Available from these sellers.

Customers Who Bought This Item Also Bought

Page 1 of 1 Start overPage 1 of 1

This shopping feature will continue to load items. In order to navigate out of this carousel please use your heading shortcut key to navigate to the next or previous heading.

John E. Hopcroft

69

Hardcover
Richard J. Trudeau

75

in Graph Theory
Paperback
$7.90
Thomas H Cormen

133

Hardcover
John E. Hopcroft

69

Hardcover
Thomas H. Cormen

418

Hardcover
John R. Pierce

88

Paperback
$3.99

Customers Viewing This Page May Be Interested In These Sponsored Links

(What's this?)

NO_CONTENT_IN_FEATURE

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 Best Sellers Rank: #418,980 in Books (See Top 100 in Books)
- #76 in Books > Computers & Technology > Computer Science > AI & Machine Learning > Machine Theory
- #91 in Books > Textbooks > Computer Science > Algorithms
- #112 in Books > Science & Math > Mathematics > Pure Mathematics > Discrete Mathematics

Would you like to update product info or give feedback on images?

Customers Viewing This Page May Be Interested In These Sponsored Links

(What's this?)

Customer Reviews

4.5 out of 5 stars

5 star		82%
4 star		5%
3 star		2%
2 star		5%
1 star		6%

Write a customer review

See all 54 customer reviews

Top Customer Reviews

Absolutely Amazing

ByA. Scudieroon July 18, 2001

Format: Hardcover

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.

0Comment 95 people found this helpful. Was this review helpful to you?YesNo

a lifesaver for all computer science majors!

ByA customeron December 30, 1999

Format: Hardcover

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!

0Comment 61 people found this helpful. Was this review helpful to you?YesNo

Makes the study of Formal Langs amenable to bedtime reading!

ByRam Mohan Raoon August 13, 2000

Format: Hardcover

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.

0Comment 68 people found this helpful. Was this review helpful to you?YesNo

ByMike N. Christoffon May 30, 2000

Format: Hardcover

Reading this book changed my entire set of beliefs regarding the importance and usefulness of computational theory (and math) in computer science. I have been programming since grade 7, yet only after reading this book do I feel like I really have a grasp of it on a fundamental level. Its like there was this whole other world under my nose that I caught passing glimpses of yet was never able to put together. Like in DOS: c:>dir *, why use a star character? Why is XML the way it is? The list goes on and on. This book tied *alot* of 'loose ends' for me.
I always felt that being a cs-tist was about programming, object oriented design/analysis, design patterns, UML, etc.. And there is no doubt that mastery of these technologies are required of any good cs-tist. However, if you want to understand where all these technologies you use come from, how they connect, and to get a glimpse of where its all going, you must combine your current programming and trend following expertise with knowledge of the underlying theories of computation.
This book should be required reading for all first year CS students so that they may get the 'big picture' right from the start and be able to see CS as a whole rather than a bunch of 'kinda related' courses. I see this book inspiring a whole generation of cs-tists - many of whom may have gone into other professions after reading books like 'Introduction to Automata Theory, Languages, and Computation' by Ullman, Hopcroft (a great, rigorous treatment of cs, but *not* a good book to learn from or be inspired by).
Again, great book!

0Comment 20 people found this helpful. Was this review helpful to you?YesNo

Customer Images

See all customer images

Most Recent Customer Reviews

excellent just like new

Published 17 days ago by Amazon Customer

Truly Remarkable book

I don't care who you are, what you do, how much math you know, everybody should read this book, thoroughly.

Published 6 months ago by Mason D. Kennedy

superb. When my professor fails, this book succeeds

Published 7 months ago by Mohamad Zein

My appreciation for this book has grown a lot over time. At first, when reading it for a course, it appeared to me as Yet Another Textbook.Read more

Published 8 months ago by Epimachus

Good and useful.

Published 1 year ago by Wonny

Wonderfully difficult but comprehensive book outlining the theory behind computability that every CS student should know.

Published 1 year ago by Tommy Dietert

Anyone who is interested in computation theory.

This book is awesome.

Sipser is a genius and Theory of Computation is an amazing subject with proofs built...Read more

Published on June 18, 2013 by Timothy Swan

So far a good book

This book explains things very well and it has many examples which help to clear up everything. I feel that many books leave out examples, but this book has a lot of examples and...Read more

Published on January 12, 2013 by some_random_stranger

Wow... c'mon Sipser

Ok. So here goes nothing.

I've spent the entire semester frustrated with this book. To give you an idea of my background, I'm a computer science student with a focus...Read more

Published on December 19, 2012 by C. Hockenbrocht

Excellent Work For Students With Varying Computing And Mathematics Backgrounds Or Those With An Interest In These Subjects

This text provides a gentle introduction of this theory covering all three aspects: automata, complexity, and computability.Read more

Published on November 30, 2012 by Agrippa's Epiphany

What Other Items Do Customers Buy After Viewing This Item?

Introduction to the Theory of Computation Hardcover

Michael Sipser

82

$232.32
Introduction to the Theory of Computation Hardcover

Michael Sipser

82
Introduction to the Theory of Computation Paperback

Sipser

82
Introduction to the Theory of Computation (3rd Edition) [International Edition] Paperback

by Michael Sipser

Conditions of Use
Privacy Notice
Interest-Based Ads
© 1996-2016, Amazon.com, Inc. or its affiliates