What's the difference between "polynomial time Turing-reducible" and "polynomial time many-to-one reducible"?
A polynomial-time many-one reduction is a polynomial Turing reduction that only calls the oracle once, and that returns the oracle's answer without any further computation.