A detail on variant of Mahaney's theorem about reductions of sparse languages vs P/NP
No, what you suggest would be meaningless. The Turing reduction is also polytime. For a proof, see Theorem 3.2 in Oded Goldreich's lecture notes.