Picture of author.
3 Works 782 Membros 6 Críticas 1 Favorited

About the Author

Michael Sipser has taught theoretical computer science and other mathematical subjects at the Massachusetts Institute of Technology for the past 32 years. He is the Head of the Mathematics Department and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL). He enjoys mostrar mais teaching and pondering the many mysteries of complexity theory. mostrar menos

Includes the name: Michael Sipser -

Obras por Michael Sipser

Etiquetado

Conhecimento Comum

Membros

Críticas

first glance: 2022-02-21---2022-02-27
 
Assinalado
icstorm | 5 outras críticas | Aug 11, 2022 |
I read this for a class in the Theory of Computation. The book was very clear and as easy to read as any other theoretical math textbook.
 
Assinalado
sbloom42 | 5 outras críticas | May 21, 2014 |
Sipser starts from a treatment of basic set theory and proofs. He moves from there through regular languages & finite automata, context-free languages & pushdown automata, and on to Turing machines & the associated complexity theory (that P and NP jazz), and more. He thus builds a rigorous and pretty complete theory of computation course from the ground up, accessible to any determined reader with a little aptitude for finite math.

The end of each chapter features dozens of general "exercises" and more rigorous "problems". Answers are provided for a few. When an exercise or problem makes reference to the chapter text, it's always easy to locate, as "figures", "theorems", "definitions", and so on are counted in the same series -- e.g. Figure 1.4 is found just before Definition 1.5. It's a small but refreshing design choice, one of many nice design choices in this beautiful volume.

The new edition is quite expensive indeed, especially considering how small the book is. The new content since the second edition consists of some corrections and minor changes, and a new section on deterministic context-free languages. If you are buying this book for a course that won't cover deterministic CFL's -- a very challenging topic -- you might ask your instructor for permission to use the second edition. The new material does have some relevance to compilers, though, so you might like to have it handy if you plan to study compilers later.
… (mais)
 
Assinalado
Tammmer | 5 outras críticas | Dec 7, 2013 |
This book is a real gem. A coherent focus is maintained throughout, subjects are introduced in a rational order, and not a word or paragraph is wasted. The assignments at the end of the chapter are excellently selected to enhance understanding or to encourage investigation of topics which the book does not cover.
 
Assinalado
themulhern | 5 outras críticas | Dec 6, 2011 |

Listas

You May Also Like

Estatísticas

Obras
3
Membros
782
Popularidade
#32,555
Avaliação
4.0
Críticas
6
ISBN
17
Línguas
2
Marcado como favorito
1

Tabelas & Gráficos