http://worldcat.org/entity/work/id/2242997937

Bounded query classes and the difference hierarchy

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."

Open All Close All