Introduction to the Theory of Computation 2nd Edition

by Michael Sipser (Author)

64 ratings

ISBN-13: 978-0534950972

ISBN-10: 0534950973

Why is ISBN important?

Other Sellers

from

Other Sellers

See all 8 versions

Used: Acceptable | Details

Sold by -OnTimeBooks-

Fulfilled by Amazon

Access codes and supplements are not guaranteed with used items.

FREE delivery February 4 - 6

Or fastest delivery February 2 - 3

Only 1 left in stock - order soon.

Sold by THE READER EAGLE LLC and Fulfilled by Amazon.

Available at a lower price from other sellers that may not offer free Prime shipping.

List Price: $267.95 Details

Save: $117.73 (44%)

FREE delivery Tuesday, February 1

Or fastest delivery Friday, January 28

Available at a lower price from other sellers that may not offer free Prime shipping.

There is a newer edition of this item:

Introduction to the Theory of Computation
$100.80
In stock.

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.

Customers who viewed this item also viewed

Page 1 of 1 Start overPage 1 of 1

Michael Sipser
193
Hardcover
8 offers from $87.61
Sipser
147
Paperback
33 offers from $5.00
John Hopcroft
217
Hardcover
25 offers from $93.76
Sanjeev Arora
85
Hardcover
25 offers from $37.76
Cristopher Moore
53
Hardcover
27 offers from $54.79
Michael Sipser
72
Hardcover
43 offers from $2.46

Customers who bought this item also bought

Page 1 of 1 Start overPage 1 of 1

Thomas H. Cormen
1,714
Hardcover
in Computer Algorithms
29 offers from $48.00
Sanjeev Arora
85
Hardcover
25 offers from $37.76
Martin Davis
11
Hardcover
22 offers from $24.37
Harold Abelson
471
Paperback
34 offers from $38.45
Timothy Gowers
274
Hardcover
45 offers from $48.86
Charles Petzold
283
Paperback
57 offers from $9.20

Editorial Reviews

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 is a model for readability, with a sensitivity for what students find difficult."

About the Author

Michael Sipser has taught theoretical computer science and mathematics at the Massachusetts Institute of Technology for the past 32 years. He is a Professor of Applied Mathematics, a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), and the current head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.

Product details

Publisher ‏ : ‎ Course Technology; 2nd edition (February 15, 2006)
Language ‏ : ‎ English
Hardcover ‏ : ‎ 431 pages
ISBN-10 ‏ : ‎ 0534950973
ISBN-13 ‏ : ‎ 978-0534950972
Item Weight ‏ : ‎ 1 pounds
Dimensions ‏ : ‎ 6.5 x 1 x 9.25 inches

Best Sellers Rank: #250,702 in Books (See Top 100 in Books)
- #61 in Machine Theory (Books)
- #3,059 in Computer Science (Books)

Customer Reviews:
64 ratings

About the author

Follow authors to get new release updates, plus improved recommendations.

Michael Sipser

Brief content visible, double tap to read full content.

Full content visible, double tap to read brief content.

Discover more of the author’s books, see similar authors, read author blogs and more

Customer reviews

5 star		72%
4 star		17%
3 star		5%
2 star		3%
1 star		3%

How are ratings calculated?

Top reviews from the United States

There was a problem filtering reviews right now. Please try again later.

L. Blunden

Appeals to novice and expert

Reviewed in the United States on February 27, 2006

Verified Purchase

I have a long experience with software development, but not much background in computation theory, just fascinating tidbits I have picked up here and there. So, this book for the first time deepens and organizes for me this hightly abstract and difficult topic.

Being a novice, I at first was afraid that the text of the book would be beyond my understanding. It was not. For sure, the proofs are difficult and may appeal to the person with a degree in computer science. But the copious diagrams, figures and tables are wonderful supplements to the understandable text. For the first time I really could grasp the subtleties of the finit automata, non-determinism, regular expressions, pushdown automata and other topics.

Certainly I can recommend this book to the beginner at computation theory, and even to the more advanced student who may want to review the topic.

18 people found this helpful

Helpful

The Yeknod

Not Easy

Reviewed in the United States on April 19, 2013

Verified Purchase

Computational Theory is not an easy subject, and anyone who says it is is lying to you. That said, this text does a fairly good job of stepping you through from fairly basic logic patterns into the finer points of Turing machines. This was used as a text for my class by one of the professors that I have the most respect for, so having him choose it just reinforces how I feel about it. There isn't a lot of hand-holding, but you will get all the information you need, if a little dense.

Helpful

Jason McQuinn

Good buy

Reviewed in the United States on August 1, 2018

Verified Purchase

Book was in great condition when I got it

Helpful

Haitham Gad

Recommended

Reviewed in the United States on April 11, 2011

Verified Purchase

In this book, Sipser does a good job at introducing the subject, starting as simple as finite automata and regular languages, working his way through Turing machines, decidable/recognizable languages (aka recursive/recursively enumerable languages), reduction, recursion and time/space complexity theories. It has a lot of formal/informal proofs that makes it a bit difficult to digest, but it certainly pays off when you start working your way through algorithm analysis and design. It builds the required theoretical background that lets you decide if a problem is fundamentally computable, and if so, how hard it is to find a solution for it.

Helpful

Colby

Best CS theory book I've ever read

Reviewed in the United States on April 9, 2016

Verified Purchase

This was required reading for a class of mine and it is by far the best textbook I have ever read. It explains the concepts in a very understandable manner and it also gives some interesting history to go along with it. It's the only textbook I've gone back to read again after the class ended. Ita hands down the best boom on the theory of computer science.

One person found this helpful

Helpful

Phillip

Good Theory Book

Reviewed in the United States on December 19, 2013

Verified Purchase

I had this book for my Theory of Computation class. It came in good condition. The author glosses over the little details sometimes in his book, specifically with the proofs. This has some good and back aspects to it. Otherwise, I enjoyed the book and the subject in general.

Helpful

Benjammin

New book. Good seller.

Reviewed in the United States on February 1, 2017

Verified Purchase

Bought it for school... I hope to never read it again.

Helpful

Anas N.Alazayed

Clear, Easy, And a lot of Examples!!

Reviewed in the United States on September 24, 2015

Verified Purchase

The best thing about this book, is that is has many examples.
So you will be able to test your understanding of the material.
And it's clear and easy, plus there is a full YouTube lectures
provided by a professor (you will find it on channel called UCDavis)
It covers the book so it's great to sort of watch and read
to maximize your learning.
Note: this book require prior knowledge of discrete mathematics.

One person found this helpful

Helpful

Top reviews from other countries

ebay

Condition very good, yellowish pages, third reprint 2007 by Baba peinters, not Cengage. 2e edition

Reviewed in India on July 2, 2020

Verified Purchase

Condition is good and no page missing. Colour is yellowish though. Its Second Edition (2e) as per details but does not mention 2012 print by Cengage, just says third reprint 2007 inside printed by Baba printers.

Shivali

The best book

Reviewed in India on August 24, 2021

Verified Purchase

The book is in good condition and delivered on time. This the best book for Toc and if you are doing computational complexity course, there also most of the people use this book for complexity classes. Its always good to have the siper's book.

Navjit Singh

This book is so good that it will make learning TOC fun

Reviewed in India on April 18, 2015

Verified Purchase

This book is so good that it will make learning TOC fun. I highly recommend this book to everyone who really want to learn in easy and elegant manner.

2 people found this helpful

A-Reader

Good introductory book on theory of computation ...

Reviewed in India on April 17, 2014

Verified Purchase

I read initial chapters and found that author made genuine efforts to teach the subject to readers in a logical way. I enjoyed reading this book. I highly recommend this book for those who are taking theory of computation seriously.

2 people found this helpful

Manu

Very good book on the subject

Reviewed in India on August 24, 2014

Verified Purchase

Enjoyed reading initial few chapters on Automata theory. Thanks Amazon for availing the product in short period of time!!

2 people found this helpful

See all reviews

Introduction to the Theory of Computation 2nd Edition

Buy used: $35.27

Buy new: $150.22

There is a newer edition of this item:

Customers who viewed this item also viewed

Customers who bought this item also bought

Editorial Reviews

Review

About the Author

Product details

About the author

Michael Sipser

Customer reviews

Top reviews from the United States

There was a problem filtering reviews right now. Please try again later.

Top reviews from other countries

Buy used:

$35.27

Buy new:

$150.22