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
2009
2009
The first order theories of the Medvedev and the Muchnik lattice
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third… 
Review
2008
Review
2008
Some results on $\mathbb{R}$-computable structures
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the… 
2007
2007
Extending Kleene ’ s O Using Infinite Time Turing Machines , or How With Time She Grew
We define two successive extensions of Kleene’s O using infinite time Turing machines. The first extension, O, is proved to code… 
2007
2007
Key-Substitution Attacks on Group Signature
Group signatures were introduced by Chaum and Van Heyst [12], and many security requirements for group signatures have been… 
2001
2001
Faster Generation of NICE-Schnorr-Type Signatures
In [7] there was proposed a Schnorr-type signature scheme based on non-maximal imaginary quadratic orders, which signature… 
1999
1999
Computable Structures: Presentations Matter
The computability properties of a relation R not included in the language of a computable structure A can vary from one… 
1997
1997
De nability in the Enumeration
We prove that every countable relation on the enumeration degrees, E, is uniformly deenable from parameters in E. Consequently… 
1996
1996
Diierence Sets and Computability Theory Zoltt an F Uredi
For a set A of non-negative integers, let D(A) (the diierence set of A) be the set of non-negative diierences of elements of A…