Title :
Bounded queries in recursion theory: a survey
Author :
Gasarch, William
Author_Institution :
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
fDate :
30 Jun-3 Jul 1991
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
Keywords :
computational complexity; bounded queries; recursion theory; Complexity theory; Computer science; Concurrent computing; Educational institutions; Turing machines;
Conference_Titel :
Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
Conference_Location :
Chicago, IL
Print_ISBN :
0-8186-2255-5
DOI :
10.1109/SCT.1991.160245
