A ≤_T B means A is computable by a Turing machine with oracle access to B. Equivalent to A being effectively decidable once membership queries in B are allowed. The equivalence classes under ≤_T form the Turing degrees, with ∅…
A ≤_T B means A is computable by a Turing machine with oracle access to B. Equivalent to A being effectively decidable once membership queries in B are allowed. The equivalence classes under ≤_T form the Turing degrees, with ∅…