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)

Related topics

Related topics

6 relations

Broader (2)

Computability theoryTheory of computation
Computable functionCreative and productive setsMyhill isomorphism theoremNumbering (computability theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
G_{\delta \sigma}-games and generalized computation
We show the equivalence between the existence of winning strategies for $G_{\delta \sigma}$ (also called $\Sigma^{0}_{3}$) games… 
2009
2009
SOME RESULTS ON R-COMPUTABLE STRUCTURES
2007
2007
The settling-time reducibility ordering
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
Recursive versus recursively enumerable binary relations
The properties of antisymmetry and linearity are easily seen to be sufficient for a recursively enumerable binary relation to be… 
1987
1987
Recursively rigid Boolean algebras
1984
1984
Recursive linear orders with recursive successivities
1984
1984
Recursive automorphisms of recursive linear orderings
1983
1983
Kleene index sets and functional m-degrees
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
Recursive properties of isomorphism types
Abstract For Γ a revursively enumerable set of formulae, a structure U on a recursive universe is said to be “Γ-recursively… 
1982
1982
A Note on Natural Complete Sets and Gödel Numberings
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)