| Description |
xix, 609 pages : illustrations ; 24 cm |
| Series |
Computer science and scientific computing |
|
Computer science and scientific computing.
|
| Contents |
Machine derived contents note: Table of contents for Computability, complexity, and languages : fundamentals of theoretical computer science / Martin D. Davis, Ron Sigal, Elaine J. Weyuker. -- Bibliographic record and links to related information available from the Library of Congress catalog -- Information from electronic data provided by the publisher. May be incomplete or contain other coding. -- 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. -- Library of Congress subject headings for this publication: Machine theory, Computational complexity, Formal languages |
| Analysis |
Mathematical logic |
| Bibliography |
Includes bibliographical references (pages 593-594) and index |
| Subject |
Computational complexity.
|
|
Formal languages.
|
|
Machine theory.
|
| Author |
Sigal, Ron.
|
|
Weyuker, Elaine J.
|
| LC no. |
93026807 |
| ISBN |
0122063821 (acid-free paper) |
|
