Source: wikibot/computable-isomorphism
= Computable isomorphism
{wiki=Computable_isomorphism}
Computable isomorphism, in the context of mathematical logic and computability theory, refers to a specific type of isomorphism between two structures (usually algebraic structures like groups, rings, etc.) that can be effectively computed by a Turing machine.