Computable isomorphism
In computability theory two sets A,B of natural numbers are computably isomorphic or recursively isomorphic if there exists a total computable and bijective function f:ℕ→ℕ such that the image of f restricted to A⊆ℕ equals B⊆ℕ, i.e. f(A)=B. Further, two numberings ν and μ (of the same set of objects) are called computably isomorphic if there exists a computable bijection f so that ν=μ∘f. Computably isomorphic numberings induce the same notion of computability on a set.
Wikipedia contributors, "Computable isomorphism", Wikipedia, revision 1322667615, retrieved 20 November 2026, source, CC BY-SA 4.0.