
Introduction to the theory of computation
Michael Sipser · 1997
Mathematics and physics › Feynman and physics
#431 most recommended
Hacker News
96
mentions by 89 people · top 4% of 15,732 books
Open Library
—
No ratings yet
40 want to read
Wikipedia
372
article views a month
About the book
Sipser's text is an undergraduate introduction to the mathematical theory of computation. It covers finite automata and regular languages, context-free grammars and pushdown automata, Turing machines, decidability, and the basics of computational complexity, including time and space classes and NP-completeness. The text holds that computation can be studied as a precise mathematical subject with provable limits. It builds a hierarchy of machine models, from finite automata through pushdown automata to Turing machines, and characterizes exactly which languages each can recognize. It shows, using diagonalization and reductions, that some problems are undecidable by any algorithm. It then classifies decidable problems by the time and memory they require, presenting P versus NP as the central open question about efficient computation.
Written by Claude from what it knows of this book.
What Hacker News says 74% recommend · 0% critical
In the commenters’ own words
I broke up my list into cultural (that is, about the people, history, etc), popular (that is, not aimed at a student or an expert), and texts. CULTURAL…
What do you want to learn? Programming or CS? CS is more than just programming, and CS theory is more than just Algorithms & Data Structures. If you want to…
What Open Library readers say
No Open Library reader has rated it yet.
- 40 want to read
- 1 reading
- 0 have read
What Wikipedia says
- 372 views a month
Reddit communities — coming later
The threads it came up in
- Ask HN: What are you reading?
- Ask HN: Which books do you consider real gems in your field of work/study?
- Ask HN: Which book can attract anyone towards your field of study?
- Ask HN: Books with a high signal to noise ratio?
- Ask HN: Math books that made you significantly better at math?
- Ask HN: What are the most fundamental books on computer science?
- Ask HN: What's the best computer science book you've read recently?
- Ask HN: I'm looking for a good book on the fundamentals of CS
Details
- First published
- 1997
- ISBN
- 9781133187790
- Editions known
- 4 at Open Library
- Open Library
- OL19859284W
511.35Computational complexityMachine theoryQa267 .s56 2013
Read next: its neighbours on the mosaic
Introduction to AlgorithmsThomas H. Cormen · 1990 · recommended by 274 people · 12 people recommended both
An introduction to Kolmogorov complexity and its applicationsMing Li · 1993 · recommended by 5 people · 2 people recommended both
Modern Operating SystemsAndrew S. Tanenbaum · 1992 · recommended by 52 people · 6 people recommended both
Introduction to Compiler DesignTorben Ægidius Mogensen · 2017 · recommended by 1 person · similar by subject and what people say about it
Algorithm designJon Kleinberg · 1922 · recommended by 30 people · named together in 3 comments
Languages and machinesThomas A. Sudkamp · 1988 · recommended by 2 people · similar by subject and what people say about it
Structure and Interpretation of Computer ProgramsHarold Abelson · 1984 · recommended by 347 people · 11 people recommended both
Computers and intractabilityMichael R. Garey · 1979 · recommended by 5 people · similar by subject and what people say about it
Computational complexitySanjeev Arora · 2007 · recommended by 3 people · similar by subject and what people say about it
Introduction to automata theory, languages, and computationJohn E. Hopcroft · 1979 · recommended by 24 people · named together in 3 comments
Concrete mathematicsRonald L. Graham · 1988 · recommended by 140 people · 5 people recommended both
Computational complexityChristos H. Papadimitriou · 1994 · recommended by 7 people · similar by subject and what people say about it
Compilers, principles, techniques, and toolsAlfred V. Aho · 1986 · recommended by 195 people · 5 people recommended both
Computability, complexity, and languagesDavis, Martin · 1983 · recommended by 1 person · similar by subject and what people say about it
Computer architectureJohn L. Hennessy · 1989 · recommended by 59 people · 3 people recommended both
An introduction to formal languages and automataPeter Linz · 1990 · recommended by 4 people · similar by subject and what people say about it
Computer scienceJ. Glenn Brookshear · 1985 · recommended by 8 people · similar by subject and what people say about it
Program ConstructionRoland C. Backhouse · 2003 · recommended by 3 people · similar by subject and what people say about it
The Annotated TuringCharles Petzold · 2008 · recommended by 56 people · 3 people recommended both
The Little SchemerDaniel P. Friedman · 1995 · recommended by 288 people · 7 people recommended both
Computer systemsRandal Bryant · 2002 · recommended by 67 people · 4 people recommended both
The algorithm design manualSteven S. Skiena · 1998 · recommended by 195 people · 5 people recommended both
Essentials of programming languagesDaniel P. Friedman · 1992 · recommended by 43 people · 3 people recommended both
Elements of the Theory of ComputationLewis, Harry R., and Christos H. Papadimitriou · 1981 · recommended by 5 people · similar by subject and what people say about it