Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource)
Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource)
Resource Information
The item Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexitymuch like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function
 Language

 eng
 eng
 Edition
 1st ed. 1999.
 Extent
 1 online resource (XIII, 353 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 A: Getting Your Feet Wet
 1 Basic Concepts
 2 Bounded Queries and the Halting Set
 3 Definitions and Questions
 B: The Complexity of Functions
 4 The Complexity of CnA
 5 #nA and Other Functions
 C: The Complexity of Sets
 6 The Complexity of ODDnA and MODmnA
 7 Q Versus QC
 8 Separating and Collapsing Classes
 D: Miscellaneous
 9 Nondeterministic Complexity
 10 The Literature on Bounded Queries
 References
 Isbn
 9781461206354
 Label
 Bounded Queries in Recursion Theory
 Title
 Bounded Queries in Recursion Theory
 Statement of responsibility
 by William Levine, Georgia Martin
 Subject

 Mathematics
 Operator theory
 Computer science
 Information theory
 Computational Mathematics and Numerical Analysis
 Theory of Computation
 Computational complexity
 Math Applications in Computer Science
 Operator Theory
 Discrete Mathematics in Computer Science
 Applications of Mathematics
 Computer science  Mathematics
 Language

 eng
 eng
 Summary
 One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexitymuch like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function
 http://library.link/vocab/creatorName
 Levine, William
 Dewey number
 004.0151
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsaut

 oqhu87p5RRU
 srLOIOBH5vM
 Image bit depth
 0
 Language note
 English
 LC call number
 QA76.9.M35
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName
 Martin, Georgia.
 Series statement
 Progress in Computer Science and Applied Logic,
 Series volume
 16
 http://library.link/vocab/subjectName

 Computer science
 Operator theory
 Information theory
 Computational complexity
 Computer science
 Mathematics
 Math Applications in Computer Science
 Operator Theory
 Theory of Computation
 Discrete Mathematics in Computer Science
 Computational Mathematics and Numerical Analysis
 Applications of Mathematics
 Label
 Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 A: Getting Your Feet Wet  1 Basic Concepts  2 Bounded Queries and the Halting Set  3 Definitions and Questions  B: The Complexity of Functions  4 The Complexity of CnA  5 #nA and Other Functions  C: The Complexity of Sets  6 The Complexity of ODDnA and MODmnA  7 Q Versus QC  8 Separating and Collapsing Classes  D: Miscellaneous  9 Nondeterministic Complexity  10 The Literature on Bounded Queries  References
 Dimensions
 unknown
 Edition
 1st ed. 1999.
 Extent
 1 online resource (XIII, 353 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9781461206354
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/9781461206354
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)3400000000089210
 (SSID)ssj0000933671
 (PQKBManifestationID)11513292
 (PQKBTitleCode)TC0000933671
 (PQKBWorkID)10891399
 (PQKB)10362828
 (DEHe213)9781461206354
 (MiAaPQ)EBC3074775
 (EXLCZ)993400000000089210
 Label
 Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 A: Getting Your Feet Wet  1 Basic Concepts  2 Bounded Queries and the Halting Set  3 Definitions and Questions  B: The Complexity of Functions  4 The Complexity of CnA  5 #nA and Other Functions  C: The Complexity of Sets  6 The Complexity of ODDnA and MODmnA  7 Q Versus QC  8 Separating and Collapsing Classes  D: Miscellaneous  9 Nondeterministic Complexity  10 The Literature on Bounded Queries  References
 Dimensions
 unknown
 Edition
 1st ed. 1999.
 Extent
 1 online resource (XIII, 353 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9781461206354
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/9781461206354
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)3400000000089210
 (SSID)ssj0000933671
 (PQKBManifestationID)11513292
 (PQKBTitleCode)TC0000933671
 (PQKBWorkID)10891399
 (PQKB)10362828
 (DEHe213)9781461206354
 (MiAaPQ)EBC3074775
 (EXLCZ)993400000000089210
Subject
 Applications of Mathematics
 Computational Mathematics and Numerical Analysis
 Computational complexity
 Computer science
 Computer science  Mathematics
 Discrete Mathematics in Computer Science
 Information theory
 Math Applications in Computer Science
 Mathematics
 Operator Theory
 Operator theory
 Theory of Computation
Member of
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
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.libraries.ou.edu/portal/BoundedQueriesinRecursionTheorybyWilliam/cN0q6vtqwkg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/BoundedQueriesinRecursionTheorybyWilliam/cN0q6vtqwkg/">Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma 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 Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource)
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.libraries.ou.edu/portal/BoundedQueriesinRecursionTheorybyWilliam/cN0q6vtqwkg/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/BoundedQueriesinRecursionTheorybyWilliam/cN0q6vtqwkg/">Bounded Queries in Recursion Theory, by William Levine, Georgia Martin, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>