Sold out but wanted!
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 email you as soon as we track it down.
Payment methods
We’re missing your review here.
- Title
- Computability, Complexity, and Languages
- Subtitle
- Fundamentals of Theoretical Computer Science
- Language
- English
- Authors
- Martin Davis, Ron Sigal, Elaine J Weyuker
- Publisher
- Morgan Kaufmann
- Released
- 1994
- ISBN10
- 0122063821
- ISBN13
- 9780122063824
- Series
- Rating
- 3.95 out of 5
- Description
- 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.


