@article{Beigel1989NondeterministicBQ,
title={Nondeterministic Bounded Query Reducibilities},
author={Richard Beigel and William I. Gasarch and James C. Owings},
journal={Ann. Pure Appl. Logic},
year={1989},
volume={41},
pages={107-118}
}

A query-bounded Turing machine is an oracle machine which computes its output function from a bounded number of queries to its oracle. In this paper we investigate the behavior of nondeterministic query-bounded Turing machines. In particular we study how easily such machines can compute the function F A n (x1, . . . , xn) from A, where A ⊆ N and F A n (x1, . . . , xn) = 〈χA(x1), . . . , χA(xn)〉. We show that each truth-table degree contains a set A such that, F A n can be nondeterministically… CONTINUE READING