skip to content
Bounded query classes and the difference hierarchy Preview this item
ClosePreview this item
Checking...

Bounded query classes and the difference hierarchy

Author: Richard Beigel; William I Gasarch; Louise Hay
Publisher: College Park, Md. : University of Maryland, 1987.
Series: University of Maryland at College Park.; Computer science technical report series
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "Let A be any nonrecursive set. We define a hierarchy of sets (and a corresponding hierarchy of degrees) that are Turing reducible to A based on bounding the number of questions to A that an oracle machine can make. If A = K then our hierarchy of sets interleaves with the difference hierarchy on the r.e. sets in a logarithmic way; however, our hierarchy of degrees is a sub-hierarchy if the difference  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Richard Beigel; William I Gasarch; Louise Hay
OCLC Number: 21101660
Notes: "May 8, 1987."
Description: 26 pages ; 28 cm.
Series Title: University of Maryland at College Park.; Computer science technical report series
Responsibility: Richard Beigel, William Gasarch, Louise Hay.

Abstract:

Abstract: "Let A be any nonrecursive set. We define a hierarchy of sets (and a corresponding hierarchy of degrees) that are Turing reducible to A based on bounding the number of questions to A that an oracle machine can make. If A = K then our hierarchy of sets interleaves with the difference hierarchy on the r.e. sets in a logarithmic way; however, our hierarchy of degrees is a sub-hierarchy if the difference degrees."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/21101660>
library:oclcnum"21101660"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1987"
schema:description"Abstract: "Let A be any nonrecursive set. We define a hierarchy of sets (and a corresponding hierarchy of degrees) that are Turing reducible to A based on bounding the number of questions to A that an oracle machine can make. If A = K then our hierarchy of sets interleaves with the difference hierarchy on the r.e. sets in a logarithmic way; however, our hierarchy of degrees is a sub-hierarchy if the difference degrees.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/22024677>
schema:inLanguage"en"
schema:isPartOf
schema:name"Bounded query classes and the difference hierarchy"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.