Borrow it
Coverart for item
The Resource Computability and complexity theory, Steven Homer, Alan L. Selman

Computability and complexity theory, Steven Homer, Alan L. Selman

Creator
Contributor
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
Work
Publication
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
Instance
Label
Computability and complexity theory
Title
Computability and complexity theory
Statement of responsibility
Steven Homer, Alan L. Selman
Creator
Contributor
Subject
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
Member of
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
Instantiates
Publication
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
Publication
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

Member of

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

Library Links

Zepheira Logo
Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by Boston University Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...