Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science by Martin DavisComputability, Complexity, and Languages: Fundamentals of Theoretical Computer Science by Martin Davis

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

byMartin Davis, Martin Davis, Ron Sigal...

Other | March 18, 1994

Pricing and Purchase Info

$64.79 online 
$81.00 list price save 20%
Earn 324 plum® points

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Elaine Weyuker is a researcher at AT&T Labs who specializes in empirical software engineering and testing research. She is a member of the National Academy of Engineering, an IEEE Fellow, an ACM Fellow, and an AT&T Fellow. She is the co-chair of the ACM Committee on Women in Computing (ACM-W) and a member of the Coalition to Diversify ...
The Ryder Cup: Golf's Grandest Event ? A Complete History
The Ryder Cup: Golf's Grandest Event ? A Complete History

by Martin Davis

$66.93$93.00

Out of stock online

Not available in stores

Alan M. Turing: Centenary Edition
Alan M. Turing: Centenary Edition

by Sara Turing

$13.89$17.32

Available for download

Not available in stores

Shop this author
Title:Computability, Complexity, and Languages: Fundamentals of Theoretical Computer ScienceFormat:OtherDimensions:609 pages, 1 × 1 × 1 inPublished:March 18, 1994Publisher:Elsevier ScienceLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0080502466

ISBN - 13:9780080502465

Customer Reviews of Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

Reviews

Table of Contents

Preliminaries.Computability:Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems.Grammars and Automata:Regular Languages. Context-Free Languages. Context-Sensitive Languages.Logic:Propositional Calculus. Quantification Theory.Complexity:Abstract Complexity. Polynomial–Time Computability.Semantics:Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.