DeepRead
Cover of Computability, complexity, and languages

Computability, complexity, and languages

Davis, Martin · 1983

Programming and computer science › Algorithms and coding interviews

#13,689 most recommended

About the book

An introductory survey of the theoretical foundations of computer science: recursive function theory and computability, formal languages and grammars, finite automata and Turing machines, logic, computational complexity, and unsolvability. It is written for readers with little formal mathematical background, and its scope spans the field's core theory rather than any one subarea. The text presents computability, formal language theory, complexity, and undecidability as parts of one connected body of theory, with the same basic machine models and proof techniques recurring across them. Its central claim is that the limits of what can be computed, such as undecidable problems and the logical results connected to them, follow from a small set of ideas that a general reader can follow. It also treats the classification of problems by computational resources as a natural extension of the same framework.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

02420112012201420162011 peak · 1
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

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

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1983
ISBN
9780122063824
Editions known
4 at Open Library
Open Library
OL3935034W

Computational complexityFormal languagesMachine theory

Explore in the mosaic

Read next: its neighbours on the mosaic