Matches in Harvard for { <http://id.lib.harvard.edu/aleph/005512855/catalog> ?p ?o. }
Showing items 1 to 34 of
34
with 100 items per page.
- catalog abstract "This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.".
- catalog contributor b7770885.
- catalog contributor b7770886.
- catalog contributor b7770887.
- catalog created "1994.".
- catalog date "1994".
- catalog date "1994.".
- catalog dateCopyrighted "1994.".
- catalog description "Includes bibliographical references (p. 593-594) and index.".
- catalog description "This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.".
- catalog description "pt. 1. Computability -- 1. Preliminaries -- 2. Programs and computable functions -- 3. Primitive rescursive functions -- 4. A universal program -- 5. Calculations on strings -- 6. Turing machines -- 7. Processes and grammars -- 8. Classifying unsolvable problems.".
- catalog description "pt. 2. Grammars and automata -- 9. Regular languages -- 10. Context-free languages -- 11. Context-sensitive languages.".
- catalog description "pt. 3. Logic -- 12. Propositional calculus -- 13. Quantification theory.".
- catalog description "pt. 4. Complexity -- 14. Abstract complexity -- 15. Polynomial -- time computability.".
- catalog description "pt. 5. Semantics -- 16. Approximation orderings -- 17. Denotational semantics of recursion equations -- 18. Operational semantics of recursion equations.".
- catalog extent "xix, 609 p. :".
- catalog identifier "0122063821 (acid-free paper)".
- catalog isPartOf "Computer science and scientific computing".
- catalog issued "1994".
- catalog issued "1994.".
- catalog language "eng".
- catalog publisher "Boston : Academic Press, Harcourt, Brace,".
- catalog subject "511.3 20".
- catalog subject "Computational complexity.".
- catalog subject "Formal languages.".
- catalog subject "Machine theory.".
- catalog subject "QA267 .D38 1994".
- catalog tableOfContents "pt. 1. Computability -- 1. Preliminaries -- 2. Programs and computable functions -- 3. Primitive rescursive functions -- 4. A universal program -- 5. Calculations on strings -- 6. Turing machines -- 7. Processes and grammars -- 8. Classifying unsolvable problems.".
- catalog tableOfContents "pt. 2. Grammars and automata -- 9. Regular languages -- 10. Context-free languages -- 11. Context-sensitive languages.".
- catalog tableOfContents "pt. 3. Logic -- 12. Propositional calculus -- 13. Quantification theory.".
- catalog tableOfContents "pt. 4. Complexity -- 14. Abstract complexity -- 15. Polynomial -- time computability.".
- catalog tableOfContents "pt. 5. Semantics -- 16. Approximation orderings -- 17. Denotational semantics of recursion equations -- 18. Operational semantics of recursion equations.".
- catalog title "Computability, complexity, and languages : fundamentals of theoretical computer science / Martin D. Davis, Ron Sigal, Elaine J. Weyuker.".
- catalog type "text".