Is there some examples of candidate problems that have Turing reduction from SAT but no known Karp reduction?Conversely is there some examples of candidate problems that have Turing reduction to SAT but no known Karp reduction? 
Turing NP complete but not Karp NP complete?
complexity theory;np complete;reductions