Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,262,653 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.
2016
2016
Computable dimension for ordered fields
Oscar Levin
Archive for Mathematical Logic
2016
Corpus ID: 253674369
The computable dimension of a structure counts the number of computable copies up to computable isomorphism. In this paper, we…
Expand
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
2009
2009
The first order theories of the Medvedev and the Muchnik lattice
A. Lewis
,
A. Nies
,
A. Sorbi
2009
Corpus ID: 15728117
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third…
Expand
Review
2008
Review
2008
Some results on $\mathbb{R}$-computable structures
W. Calvert
,
J. Porter
2008
Corpus ID: 14093637
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the…
Expand
2007
2007
Key-Substitution Attacks on Group Signature
K. Sakumoto
,
Keisuke Tanaka
2007
Corpus ID: 8114544
Group signatures were introduced by Chaum and Van Heyst [12], and many security requirements for group signatures have been…
Expand
2000
2000
Series On Computable Theoretic Properties of Structures and Their Cartesian Products
B. Khoussainov
2000
Corpus ID: 18021958
In this paper we show that for any set X ⊂ ω there exists a structure A that has no presentation computable in X such that A has…
Expand
1999
1999
Computable Structures: Presentations Matter
R. Shore
1999
Corpus ID: 15382592
The computability properties of a relation R not included in the language of a computable structure A can vary from one…
Expand
1997
1997
De nability in the Enumeration
DegreesTheodore A. Slaman
,
W. H. WoodinyJune
1997
Corpus ID: 7029926
We prove that every countable relation on the enumeration degrees, E, is uniformly deenable from parameters in E. Consequently…
Expand
1996
1996
Diierence Sets and Computability Theory Zoltt an F Uredi
theoryRod Downey
,
C. Jockusch
,
L. Rubel
1996
Corpus ID: 16739135
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…
Expand