Borrow it
- African Studies Library
- Alumni Medical Library
- Astronomy Library
- Fineman and Pappas Law Libraries
- Frederick S. Pardee Management Library
- Howard Gotlieb Archival Research Center
- Mugar Memorial Library
- Music Library
- Pikering Educational Resources Library
- School of Theology Library
- Science & Engineering Library
- Stone Science Library
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
Resource Information
The item Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
- 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
- Language
- eng
- Edition
- 2nd ed.
- Extent
- xix, 609 pages
- 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
- Isbn
- 9780122063824
- 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
- Subject
-
- Complexité de calcul (informatique)
- Computabilidade e modelos de computacao
- Computational complexity
- Computational complexity
- Fonctions calculables
- Formal languages
- Formal languages
- Fundamentele informatica
- Informatica
- Langages formels
- Linguagens formais e automatos
- Machine theory
- Machine theory
- Automates mathématiques, Théorie des
- 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
- 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
- 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
- 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
Subject
- Complexité de calcul (informatique)
- Computabilidade e modelos de computacao
- Computational complexity
- Computational complexity
- Fonctions calculables
- Formal languages
- Formal languages
- Fundamentele informatica
- Informatica
- Langages formels
- Linguagens formais e automatos
- Machine theory
- Machine theory
- Automates mathématiques, Théorie des
Member of
Library Locations
-
African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 -71.105717
-
Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 -71.107023
-
Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 -71.099547
-
Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 -71.108227
-
Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 -71.101425
-
School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 -71.107235
-
Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 -71.102257
-
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Computability-complexity-and-languages-/i8jA-5iSJlU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Computability-complexity-and-languages-/i8jA-5iSJlU/">Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Computability-complexity-and-languages-/i8jA-5iSJlU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Computability-complexity-and-languages-/i8jA-5iSJlU/">Computability, complexity, and languages : fundamentals of theoretical computer science, Martin D. Davis, Ron Sigal, Elaine J. Weyuker</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
