About the Author
For additional information, please visit Dr. SipserÂ¿s Web site at http://www-math.mit.edu/~sipser/book.html
Wonderfully difficult but comprehensive book outlining the theory behind computability that every CS student should know.Published 2 months 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
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 I... Read morePublished on January 12, 2013 by some_random_stranger
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 in... Read more
This text provides a gentle introduction of this theory covering all three aspects: automata, complexity, and computability. Read morePublished on November 30, 2012 by Agrippa's Epiphany
This was used as a supplement for a theory of computations course I took. The teacher provided us all the problems and recommended any edition of this book as a supplement. Read morePublished on August 10, 2011 by Sambardo
As a near-straight A computer science student, I bought this book while taking an Automata and Computability class. This book was terrible. Read morePublished on August 18, 2010 by DashNY
This book is very technical in nature, but it covers everything from FA's and regular expressions all the way up to complex Turing machine problems. Read morePublished on July 26, 2010 by Samuel Leathers