Assertion: isomorphism | /r/HasProperty | computable
Facets:
value: from d$.
type: OTHER
Source sentences:
text: That is, for any Turing degree $d$, there are isomorphic graphs that are computable from oracle $d$, but no isomorphism between them is computable from $d$.