Bookbot

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

Book rating

4.0(25)Add rating

More about the book

This book is a rigorous but readable introduction to some of the central topics in theoretical computer science. The main subjects are computability theory, formal languages, logic and automated deduction, computational complexity (including NP-completeness), and programming language semantics.

Book purchase

Computability, Complexity, and Languages, Martin Davis, Ron Sigal, Elaine J Weyuker

Language
Released
1994
We’ll notify you via email once we track it down.

Payment methods

4.0
Very Good
25 Ratings

We’re missing your review here.