Turing reduction

Summary

A set $A$ is Turing reducible to a set $B$ if some oracle machine decides membership in $A$ by asking questions about $B$. It is the most general notion of "$A$ is computable from $B$" in computability theory. Turing reducibility is the basis of Turing degrees, which measure the amount of uncomputability of a set.