 Equivalently, "A" is Turing reducible to "B" if and only if there is an algorithm for computing the indicator function for "A" provided that the algorithm is provided with a means to correctly answer questions of the form "Is "n" in "B"?