You are here

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

Martin Davis, Ron Sigal, and Elaine J. Weyuker
Publisher: 
Morgan Kaufmann
Publication Date: 
1994
Number of Pages: 
609
Format: 
Hardcover
Edition: 
2
Series: 
Computer Science and Scientific Computing
Price: 
83.95
ISBN: 
978-0122063824
Category: 
Textbook
We do not plan to review this book.

 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.

Dummy View - NOT TO BE DELETED