Get Free Shipping on orders over $79
Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science - Martin Davis
eTextbook alternate format product

Instant online reading.
Don't wait for delivery!

Go digital and save!

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

By: Martin Davis, Ron Sigal, Elaine J. Weyuker

Hardcover | 17 September 2003 | Edition Number 2

At a Glance

Hardcover


$195.75

or 4 interest-free payments of $48.94 with

 or 

Ships in 15 to 25 business days

Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
  • Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.
  • The number of exercises included has more than tripled.
  • Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.
Industry Reviews
"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 well-written 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

More in Mathematical Logic

Current Trends in Automated Reasoning - Erika Bach
Handbook of Automated Reasoning - Rachel Phillips
Advances in Automated Reasoning - Rachel Phillips
Unequal : The Maths of When Things Do and Don't Add Up - Eugenia Cheng
The Language of Mathematics : The Stories behind the Symbols - Raul Rojas
How to Prove It : A Structured Approach - Daniel J. Velleman

RRP $73.95

$70.75

Kakuro Book 2 : 200 mathematical logic puzzles - The Times Mind Games
Skill Builder Sudoku : Easy to Medium - Peter Gordon
Skill Builder Sudoku : Medium to Hard - Peter Gordon
Skill Builder Sudoku : Hard to Expert - Peter Gordon
Cartesian Cubical Model Categories - Steve Awodey