Math 2.0

Concept

Computable isomorphism

Summary

In computability theory two sets A,BA, B of natural numbers are computably isomorphic or recursively isomorphic if there exists a total computable and bijective function f ⁣:ℕ→ℕf \colon \mathbb{N} \to \mathbb{N} such that the image of ff restricted to A⊆ℕA\subseteq \mathbb{N} equals B⊆ℕB\subseteq \mathbb{N}, i.e. f(A)=Bf(A) = B.

Further reading

  1. Wikipedia, page 2611685, revision 1322667615, Computable isomorphism. adopted
About this page
Tag4XPS4W1T1K
URIm2://4XPS4W1T1K
Aliasescomputably-isomorphic, recursive-isomorphism, recursively-isomorphic
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.