DeepRead
Cover of Introduction to the theory of computation

Introduction to the theory of computation

Michael Sipser · 1997

Mathematics and physics › Feynman and physics

#431 most recommended

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

051020082015202020262021 peak · 10
This bookAverage book in Feynman and physics

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 40 want to read
  • 1 reading
  • 0 have read

Open Library’s page for the book

What Wikipedia says

  • 372 views a month

Read the Wikipedia article

Reddit communities — coming later

The threads it came up in

Details

First published
1997
ISBN
9781133187790
Editions known
4 at Open Library
Open Library
OL19859284W

511.35Computational complexityMachine theoryQa267 .s56 2013

Explore in the mosaic

Read next: its neighbours on the mosaic