 You'll save an extra 5% on Books purchased from Amazon.ca, now through July 29th. No code necessary, discount applied at checkout. Here's how (restrictions apply)
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science Hardcover – Sep 17 2003
Amazon Price

New from  Used from 
Kindle Edition
"Please retry"

—  — 
Hardcover
"Please retry"

CDN$ 94.98

CDN$ 88.48  CDN$ 56.38 
Special Offers and Product Promotions
Customers Who Bought This Item Also Bought
No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
Getting the download link through email is temporarily not available. Please check back later.
To get the free app, enter your mobile phone number.
Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.
Product Details

Product Description
Review
"If there is a single book on the theory of computing that should be in every college library collection, this is it. Although written as a text for an advanced undergraduate course in theoretical computer science, the book may serve as an introductory resource, or the foundation for independent study, in many areas of theoretical computing: grammars, automata theory, computability, complexity theory, and unsolvability. The beauty of this book is that the breadth of coverage is complemented with extraordinary depth." ―CHOICE
"Theoretical computer science is often viewed as a collection of disparate topics, including computability theory, formal language theory, complexity theory, logic, and so on. This wellwritten book attempts to unify the subject by introducing each of these topics in turn, then showing how they relate to each other... This is an excellent book that succeeds in tying together a number of areas in theoretical computer science." ―COMPUTING REVIEWS
From the Back Cover
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 NPcompleteness), and programming language semantics.
See all Product DescriptionLook for similar items by category
 Books > Computers & Technology > Computer Science > Information Theory
 Books > Computers & Technology > Programming > Languages & Tools
 Books > Computers & Technology > Software
 Books > Politics & Social Sciences > Philosophy > Logic & Language
 Books > Professional & Technical > Professional Science > Mathematics > Mathematical Analysis
 Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics
 Books > Science & Math > Mathematics > Mathematical Analysis
 Books > Science & Math > Mathematics > Pure Mathematics > Discrete Mathematics
 Books > Science & Math > Mathematics > Pure Mathematics > Logic
 Books > Textbooks > Computer Science & Information Systems > Computer Science
 Books > Textbooks > Computer Science & Information Systems > Programming Languages
 Books > Textbooks > Sciences > Mathematics