Skip to content

Computability, Complexity, and Languages Fundamentals of Theoretical Computer Science

Best in textbook rentals since 2012!

ISBN-10: 0122063821

ISBN-13: 9780122063824

Edition: 2nd 1994 (Revised)

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

List price: $72.95
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

List price: $72.95
Edition: 2nd
Copyright year: 1994
Publisher: Elsevier Science & Technology
Publication date: 3/18/1994
Binding: Hardcover
Pages: 609
Size: 5.98" wide x 9.02" long x 0.59" tall
Weight: 2.486
Language: English

Ron Sigal is an independently employed software developer who has held positions at Yale University, Lafayette College, Hofstra University, and the University of Catania in Italy. He has a PhD in computer science and has published in the areas of mathematical logic, robotics, and programming languages.

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
PolynomialTime Computability
Semantics: Approximation Orderings
Denotational Semantics of Recursion Equations
Operational Semantics of Recursion Equations
Suggestions for Further Reading
Subject Index