Turing NP complete but not Karp NP complete?
The complement of any NP-complete problem (including SAT itself) is polynomial-time Turing-interreducible with SAT but, there's a Karp reduction if, and only if, NP$\,=\,$co-NP.