Computability, complexity, and languages
Work detail
Bookitis Pick
CC
Image source: Open LibraryDavis, Martin2 editions
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.
Overview
Shared work-level identity and catalog context.
1 credited authorSearch language english
Contributors
People credited with this work in the active catalog.
- Open Author
Davis, Martin
Editions
Publication-specific versions linked to this work only.
