An edition of Computability, complexity, and languages
(1983)
Computability, complexity, and languages
fundamentals of theoretical computer science
2nd. ed.
by Davis, Martin
- 1 Want to read
- 1 Currently reading
Share
×Close
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.
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
Computability, complexity, and languages: fundamentals of theoretical computer science
1994, Academic Press, Harcourt, Brace
in English
- 2nd. ed.
0122063821 9780122063824
|
aaaa
|
2
Computability, complexity, and languages: fundamentals of theoretical computer science
1983, Academic Press
in English
0122063805 9780122063800
|
eeee
|
Book Details
Edition Notes
Includes bibliographical references (p. 593-594) and index.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
| July 24, 2024 | Edited by MARC Bot | import existing book |
| February 13, 2020 | Edited by MARC Bot | remove fake subjects |
| July 21, 2017 | Edited by Mek | adding subject: In library |
| December 4, 2010 | Edited by Open Library Bot | Added subjects from MARC records. |
| December 10, 2009 | Created by WorkBot | add works page |