Computable isomorphism
In computability theory two sets of natural numbers are computably isomorphic or recursively isomorphic if there exists a total bijective computable function with . By the Myhill isomorphism theorem, the relation of computable isomorphism coincides with the relation of mutual one-one reducibility. Two numberings and are called computably isomorphic if there exists a computable bijection so that Computably isomorphic numberings induce the same notion of computability on a set.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Computable isomorphism
In computability theory two sets of natural numbers are computably isomorphic or recursively isomorphic if there exists a total bijective computable function with . By the Myhill isomorphism theorem, the relation of computable isomorphism coincides with the relation of mutual one-one reducibility. Two numberings and are called computably isomorphic if there exists a computable bijection so that Computably isomorphic numberings induce the same notion of computability on a set.
has abstract
In computability theory two se ...... ion of computability on a set.
@en
Rekursive Isomorphie ist in de ...... auf Mengen natürlicher Zahlen.
@de
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,018,722,294
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In computability theory two se ...... ion of computability on a set.
@en
Rekursive Isomorphie ist in de ...... auf Mengen natürlicher Zahlen.
@de
label
Computable isomorphism
@en
Rekursive Isomorphie
@de