It is not the case that Kreisel and Sacks showed that relativized computability contexts admit c.e. sets whose Turing degree structure diverges from the unrelativized case, undermining the generality of K's completeness claim.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.