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.) - Books - Elsevier Science & Technology - 9780122063824 - February 3, 1994
In case cover and title do not match, the title is correct

Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Computer Science and Scientific Computing 2nd edition

Price
$ 92.49
excl. VAT

Ordered from remote warehouse

Expected delivery Nov 12 - 30
Christmas presents can be returned until 31 January
Get notified about new Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.) releases

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

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
Language English  

More from the same publisher

See all of Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)