An edition of Computability, complexity, and languages
(1983)
Computability, complexity, and languages
fundamentals of theoretical computer science
by Davis, Martin
- 0 Ratings
- 1 Want to read
- 1 Currently reading
- 0 Have read
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
Showing 2 featured editions. View all 2 editions?
| Edition | Availability |
|---|---|
1
Computability, complexity, and languages: fundamentals of theoretical computer science
1994, Academic Press, Harcourt, Brace
in English
- 2nd. ed.
0122063821 9780122063824
|
zzzz
Libraries near you:
WorldCat
|
2
Computability, complexity, and languages: fundamentals of theoretical computer science
1983, Academic Press
in English
0122063805 9780122063800
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Bibliography: p. 417-418.
Includes index.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
History
- Created April 1, 2008
- 15 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| December 10, 2023 | Edited by MARC Bot | import existing book |
| December 10, 2022 | Edited by MARC Bot | import existing book |
| November 15, 2022 | Edited by ImportBot | import existing book |
| September 16, 2021 | Edited by ImportBot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |