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 University of Missouri Libraries.This item is available to borrow from 2 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 University of Missouri Libraries.
This item is available to borrow from 2 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 selfcontained, 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 NPcompleteness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."Jacket
 "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 selfcontained, 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 NPcompleteness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."BOOK 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.
 TuringMachine 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.
 Smn 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.
 Kadic 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
 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 selfcontained, 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 NPcompleteness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."Jacket
 "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 selfcontained, 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 NPcompleteness and relative computability round of the work, which focuses on the limitations of computability and the distinctions between feasible and intractable."BOOK JACKET
 Cataloging source
 DLC
 http://library.link/vocab/creatorName
 Homer, S.
 Dewey number
 004
 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
 Series statement
 Texts in computer science
 http://library.link/vocab/subjectName

 Computer science
 Computable functions
 Computational complexity
 Label
 Computability and complexity theory, Steven Homer, Alan L. Selman
 Bibliography note
 Includes bibliographical references (pages [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.
 TuringMachine 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.
 Smn 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.
 Kadic Representation.
 1.3.
 Partial Functions.
 Control code
 45315542
 Dimensions
 24 cm
 Extent
 xiii, 194 pages
 Isbn
 9780387950556
 Isbn Type
 (alk. paper)
 Lccn
 00053829
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code
 n
 Other physical details
 illustrations
 Label
 Computability and complexity theory, Steven Homer, Alan L. Selman
 Bibliography note
 Includes bibliographical references (pages [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.
 TuringMachine 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.
 Smn 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.
 Kadic Representation.
 1.3.
 Partial Functions.
 Control code
 45315542
 Dimensions
 24 cm
 Extent
 xiii, 194 pages
 Isbn
 9780387950556
 Isbn Type
 (alk. paper)
 Lccn
 00053829
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code
 n
 Other physical details
 illustrations
Library Links
Embed (Experimental)
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 faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/ikU2tUelZxE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/ikU2tUelZxE/">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.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri 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 faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/ikU2tUelZxE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/ComputabilityandcomplexitytheorySteven/ikU2tUelZxE/">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.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>