Computable isomorphism
= Computable isomorphism
A computable isomorphism is an <isomorphism> between presented structures whose underlying map is a <total computable function>. For presentations on $\mathbb N$, its inverse is computable too: enumerate inputs until the required output occurs. Two abstractly <isomorphic> structures with a <recursive presentation of a structure> need not admit a <computable isomorphism> between the chosen presentations.