Skip to search formSkip to main contentSkip to account menu

Computable isomorphism

Known as: Computably isomorphic 
In computability theory two sets of natural numbers are computably isomorphic or recursively isomorphic if there exists a total bijective computable… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We show the equivalence between the existence of winning strategies for $G_{\delta \sigma}$ (also called $\Sigma^{0}_{3}$) games… 
2007
2007
Abstract To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω there is associated a settling function… 
Review
1993
Review
1993
The properties of antisymmetry and linearity are easily seen to be sufficient for a recursively enumerable binary relation to be… 
1983
1983
Abstract A many-one degree is functional if it contains the index set of some class of partial recursive functions but does not… 
1983
1983
Abstract For Γ a revursively enumerable set of formulae, a structure U on a recursive universe is said to be “Γ-recursively…