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 and complexity theory, Steven Homer, Alan L. Selman
Computability and complexity theory, Steven Homer, Alan L. Selman
Resource Information
The item Computability and complexity theory, Steven Homer, Alan L. Selman 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 and complexity theory, Steven Homer, Alan L. Selman 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
-
- "The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations and about the efficiency of the computations that use these resources. In addition, it provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other problems."
- "Requiring no explicit prerequisite knowledge, Computability and Complexity Theory introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability NP-completeness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."--Jacket
- Language
- eng
- Extent
- xiii, 194 pages
- Contents
-
- 1.4.
- Graphs.
- 1.5.
- Propositional Logic.
- 1.6.
- Cardinality.
- 1.7.
- Elementary Algebra
- 2.
- Introduction to Computability.
- 1.
- 2.1.
- Turing Machines.
- 2.2.
- Turing-Machine Concepts.
- 2.3.
- Variations of Turing Machines.
- 2.4.
- Church's Thesis.
- 2.5.
- RAMs
- Preliminaries.
- 3.
- Undecidability.
- 3.1.
- Decision Problems.
- 3.2.
- Undecidable Problems.
- 3.3.
- Pairing Functions.
- 3.4.
- Computably Enumerable Sets.
- 1.1.
- 3.5.
- Halting Problem, Reductions, and Complete Sets.
- 3.6.
- S-m-n Theorem.
- 3.7.
- Recursion Theorem.
- 3.8.
- Rice's Theorem.
- 3.9.
- Turing Reductions and Oracle Turing Machines.
- Words and Languages.
- 3.10.
- Recursion Theorem, Continued
- 4.
- Introduction to Complexity Theory
- 1.2.
- K-adic Representation.
- 1.3.
- Partial Functions.
- Isbn
- 9780387950556
- Label
- Computability and complexity theory
- Title
- Computability and complexity theory
- Statement of responsibility
- Steven Homer, Alan L. Selman
- Subject
-
- Berekenbaarheid
- Complexiteit
- Computable functions
- Computable functions
- Computable functions
- Computable functions
- Computational complexity
- Computational complexity
- Computational complexity
- Computational complexity
- Computer science
- Computer science
- Computer science
- Computer science
- Functies (wiskunde)
- Komplexitätstheorie
- Berechnungstheorie
- Language
- eng
- Summary
-
- "The theory of computing provides computer science with concepts, models, and formalisms for reasoning about the resources needed to carry out computations and about the efficiency of the computations that use these resources. In addition, it provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other problems."
- "Requiring no explicit prerequisite knowledge, Computability and Complexity Theory introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability NP-completeness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."--Jacket
- Cataloging source
- DLC
- http://library.link/vocab/creatorName
- Homer, S.
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA76
- LC item number
- .H6236 2001
- Literary form
- non fiction
- Nature of contents
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
- Selman, Alan L
- http://library.link/vocab/subjectName
-
- Computer science
- Computable functions
- Computational complexity
- Computable functions
- Computational complexity
- Computer science
- Berekenbaarheid
- Complexiteit
- Functies (wiskunde)
- Berechnungstheorie
- Komplexitätstheorie
- Label
- Computability and complexity theory, Steven Homer, Alan L. Selman
- Bibliography note
- Includes bibliographical references (p. [181]-185) and indexes
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
-
- 1.4.
- Graphs.
- 1.5.
- Propositional Logic.
- 1.6.
- Cardinality.
- 1.7.
- Elementary Algebra
- 2.
- Introduction to Computability.
- 1.
- 2.1.
- Turing Machines.
- 2.2.
- Turing-Machine Concepts.
- 2.3.
- Variations of Turing Machines.
- 2.4.
- Church's Thesis.
- 2.5.
- RAMs
- Preliminaries.
- 3.
- Undecidability.
- 3.1.
- Decision Problems.
- 3.2.
- Undecidable Problems.
- 3.3.
- Pairing Functions.
- 3.4.
- Computably Enumerable Sets.
- 1.1.
- 3.5.
- Halting Problem, Reductions, and Complete Sets.
- 3.6.
- S-m-n Theorem.
- 3.7.
- Recursion Theorem.
- 3.8.
- Rice's Theorem.
- 3.9.
- Turing Reductions and Oracle Turing Machines.
- Words and Languages.
- 3.10.
- Recursion Theorem, Continued
- 4.
- Introduction to Complexity Theory
- 1.2.
- K-adic Representation.
- 1.3.
- Partial Functions.
- Dimensions
- 24 cm.
- Extent
- xiii, 194 pages
- Isbn
- 9780387950556
- Lccn
- 00053829
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
-
- (OCoLC)45315542
- (OCoLC)ocm45315542
- Label
- Computability and complexity theory, Steven Homer, Alan L. Selman
- Bibliography note
- Includes bibliographical references (p. [181]-185) and indexes
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
-
- 1.4.
- Graphs.
- 1.5.
- Propositional Logic.
- 1.6.
- Cardinality.
- 1.7.
- Elementary Algebra
- 2.
- Introduction to Computability.
- 1.
- 2.1.
- Turing Machines.
- 2.2.
- Turing-Machine Concepts.
- 2.3.
- Variations of Turing Machines.
- 2.4.
- Church's Thesis.
- 2.5.
- RAMs
- Preliminaries.
- 3.
- Undecidability.
- 3.1.
- Decision Problems.
- 3.2.
- Undecidable Problems.
- 3.3.
- Pairing Functions.
- 3.4.
- Computably Enumerable Sets.
- 1.1.
- 3.5.
- Halting Problem, Reductions, and Complete Sets.
- 3.6.
- S-m-n Theorem.
- 3.7.
- Recursion Theorem.
- 3.8.
- Rice's Theorem.
- 3.9.
- Turing Reductions and Oracle Turing Machines.
- Words and Languages.
- 3.10.
- Recursion Theorem, Continued
- 4.
- Introduction to Complexity Theory
- 1.2.
- K-adic Representation.
- 1.3.
- Partial Functions.
- Dimensions
- 24 cm.
- Extent
- xiii, 194 pages
- Isbn
- 9780387950556
- Lccn
- 00053829
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
-
- (OCoLC)45315542
- (OCoLC)ocm45315542
Subject
- Berekenbaarheid
- Complexiteit
- Computable functions
- Computable functions
- Computable functions
- Computable functions
- Computational complexity
- Computational complexity
- Computational complexity
- Computational complexity
- Computer science
- Computer science
- Computer science
- Computer science
- Functies (wiskunde)
- Komplexitätstheorie
- Berechnungstheorie
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-and-complexity-theory-Steven/103Ay1OEGMA/" 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-and-complexity-theory-Steven/103Ay1OEGMA/">Computability and complexity theory, Steven Homer, Alan L. Selman</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 and complexity theory, Steven Homer, Alan L. Selman
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-and-complexity-theory-Steven/103Ay1OEGMA/" 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-and-complexity-theory-Steven/103Ay1OEGMA/">Computability and complexity theory, Steven Homer, Alan L. Selman</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>