Bounded queries in recursion theory: a survey

Abstract

The author surveys much of the work that has been done on the following two questions: (1) What functions can one compute with m queries to A? and (2) Are there functions that can be computed with m queries to A that cannot be computed with m-1 queries to A? To any set X? The framework is recursion-theoretic; the computations have no time or space bound.<>