Book
Computability, complexity, and languagesDavis, Martin

Computability, complexity, and languages

Davis, Martin
1983517 pages
No counted ratings yet
2 editions

Track this book

You choose which shelves are public. Progress and read dates stay yours.
Sign in
Add to list

About

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.

More by Davis, Martin

All books

More like this

Reviews

Rating integrity

Healthy
Counted ratings come from accounts older than 7 days and were made on or after publication. Finished readers weigh ×1.0. Readers who have not finished yet weigh ×0.5. Did-not-finish ratings are shown but not counted.

Editions

2 editions
  • Other · English · 1994
    Academic Press, Harcourt, Brace · 609 pages · 9780122063824
  • Other · English · 1983
    Academic Press · 425 pages · 9780122063800
Machine theoryComputational complexityFormal languages