You are here

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

Edition: 
2
Publisher: 
Morgan Kaufmann
Number of Pages: 
609
Price: 
83.95
ISBN: 
978-0122063824
Date Received: 
Wednesday, June 6, 2007
Reviewable: 
No
Include In BLL Rating: 
Yes
Reviewer Email Address: 
Martin Davis, Ron Sigal, and Elaine J. Weyuker
Series: 
Computer Science and Scientific Computing
Publication Date: 
1994
Format: 
Hardcover
Audience: 
Category: 
Textbook

 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.

Publish Book: 
Modify Date: 
Wednesday, June 6, 2007

Dummy View - NOT TO BE DELETED