Tell your friends about this item:
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Computer Science and Scientific Computing Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.) 2nd edition
Price
$ 92.99
excl. VAT
Ordered from remote warehouse
Expected delivery Jan 12 - 23, 2026
Christmas presents can be returned until 31 January
Our customers say:
Add to your iMusic wish list
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Computer Science and Scientific Computing
Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)
Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.
609 pages, further reading, index
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | February 3, 1994 |
| ISBN13 | 9780122063824 |
| Publishers | Elsevier Science & Technology |
| Pages | 609 |
| Dimensions | 162 × 236 × 48 mm · 1.10 kg |