Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,399,332 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Broader (2)
Computability theory
Theory of computation
Computable function
Creative and productive sets
Myhill isomorphism theorem
Numbering (computability theory)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
G_{\delta \sigma}-games and generalized computation
P. Welch
2015
Corpus ID: 119697300
We show the equivalence between the existence of winning strategies for $G_{\delta \sigma}$ (also called $\Sigma^{0}_{3}$) games…
Expand
2009
2009
SOME RESULTS ON R-COMPUTABLE STRUCTURES
J. Porter
2009
Corpus ID: 51729949
2007
2007
The settling-time reducibility ordering
Barbara F. Csima
,
R. Shore
Journal of Symbolic Logic (JSL)
2007
Corpus ID: 13329413
Abstract To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω there is associated a settling function…
Expand
Review
1993
Review
1993
Recursive versus recursively enumerable binary relations
D. K. Roy
Studia Logica: An International Journal for…
1993
Corpus ID: 33526368
The properties of antisymmetry and linearity are easily seen to be sufficient for a recursively enumerable binary relation to be…
Expand
1987
1987
Recursively rigid Boolean algebras
J. Remmel
Annals of Pure and Applied Logic
1987
Corpus ID: 6568588
1984
1984
Recursive linear orders with recursive successivities
Michael F. Moses
Annals of Pure and Applied Logic
1984
Corpus ID: 7868417
1984
1984
Recursive automorphisms of recursive linear orderings
S. Schwarz
Annals of Pure and Applied Logic
1984
Corpus ID: 205076418
1983
1983
Kleene index sets and functional m-degrees
J. Mohrherr
Journal of Symbolic Logic (JSL)
1983
Corpus ID: 7115056
Abstract A many-one degree is functional if it contains the index set of some class of partial recursive functions but does not…
Expand
1983
1983
Recursive properties of isomorphism types
Michael F. Moses
Journal of the Australian Mathematical Society…
1983
Corpus ID: 55097677
Abstract For Γ a revursively enumerable set of formulae, a structure U on a recursive universe is said to be “Γ-recursively…
Expand
1982
1982
A Note on Natural Complete Sets and Gödel Numberings
J. Hartmanis
Theoretical Computer Science
1982
Corpus ID: 32602093
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)
ACCEPT & CONTINUE