The Resource Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker

Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker

Label
Computability, complexity, and languages : fundamentals of theoretical computer science
Title
Computability, complexity, and languages
Title remainder
fundamentals of theoretical computer science
Statement of responsibility
Martin D. Davis, Ron Sigal, Elaine J. Weyuker
Creator
Contributor
Subject
Language
eng
Summary
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
Member of
Cataloging source
DLC
http://library.link/vocab/creatorDate
1928-
http://library.link/vocab/creatorName
Davis, Martin
Illustrations
illustrations
Index
index present
LC call number
QA267
LC item number
.D38 1994
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Sigal, Ron
  • Weyuker, Elaine J
http://library.link/vocab/subjectName
  • Machine theory
  • Computational complexity
  • Formal languages
  • Computational complexity
  • Formal languages
  • Machine theory
  • Informatica
  • Fundamentele informatica
  • Linguagens formais e automatos
  • Computabilidade e modelos de computacao
  • Langages formels
  • Complexité de calcul (informatique)
  • Automates mathématiques, Théorie des
  • Fonctions calculables
Label
Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker
Instantiates
Publication
Bibliography note
Includes bibliographical references (p. 593-594) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 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
  • pt. 2. Grammars and automata -- 9. Regular languages -- 10. Context-free languages -- 11. Context-sensitive languages
  • pt. 3. Logic -- 12. Propositional calculus -- 13. Quantification theory
  • pt. 4. Complexity -- 14. Abstract complexity -- 15. Polynomial -- time computability
  • pt. 5. Semantics -- 16. Approximation orderings -- 17. Denotational semantics of recursion equations -- 18. Operational semantics of recursion equations
Dimensions
24 cm.
Edition
2nd ed.
Extent
xix, 609 pages
Isbn
9780122063824
Lccn
93026807
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
  • (OCoLC)28506245
  • (OCoLC)ocm28506245
Label
Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker
Publication
Bibliography note
Includes bibliographical references (p. 593-594) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 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
  • pt. 2. Grammars and automata -- 9. Regular languages -- 10. Context-free languages -- 11. Context-sensitive languages
  • pt. 3. Logic -- 12. Propositional calculus -- 13. Quantification theory
  • pt. 4. Complexity -- 14. Abstract complexity -- 15. Polynomial -- time computability
  • pt. 5. Semantics -- 16. Approximation orderings -- 17. Denotational semantics of recursion equations -- 18. Operational semantics of recursion equations
Dimensions
24 cm.
Edition
2nd ed.
Extent
xix, 609 pages
Isbn
9780122063824
Lccn
93026807
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
System control number
  • (OCoLC)28506245
  • (OCoLC)ocm28506245

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...