All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
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…
(More)
Wikipedia
Topic mentions per year
Topic mentions per year
1984-2016
0
2
4
1984
2016
Related topics
Related topics
6 relations
Broader (2)
Computability theory
Theory of computation
Computable function
Creative and productive sets
Myhill isomorphism theorem
Numbering
Related mentions per year
Related mentions per year
1938-2018
1940
1960
1980
2000
2020
Computable isomorphism
Computable function
Numbering
Theory of computation
Computability theory
Creative and productive sets
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Computable dimension for ordered fields
Oscar Levin
Arch. Math. Log.
2016
The computable dimension of a structure counts the number of computable copies up to computable isomorphism. In this paper, we…
(More)
Is this relevant?
2015
2015
Computing arithmetic Kleinian groups
Aurel Page
Math. Comput.
2015
Arithmetic Kleinian groups are arithmetic lattices in PSL2(C). We present an algorithm that, given such a group Γ, returns a…
(More)
Is this relevant?
2011
2011
The computable embedding problem
J. Carson
,
Ekaterina B. Fokina
,
Valentina S. Harizanov
,
J. F. Knight
2011
Calvert [3], [4], [5] calculated the complexity of the computable isomorphism problem for a number of familiar classes of…
(More)
Is this relevant?
2007
2007
Applications of Kolmogorov complexity to computable model theory
Bakhadyr Khoussainov
,
Pavel Semukhin
,
Frank Stephan
J. Symb. Log.
2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not א0…
(More)
Is this relevant?
2005
2005
On computable isomorphisms in efficient asymmetric pairing-based systems
Nigel P. Smart
,
Frederik Vercauteren
Discrete Applied Mathematics
2005
In this paper we examine the hard problems underlying asymmetric pairings, their precise relationships and how they affect a…
(More)
Is this relevant?
2005
2005
On Computable Isomorphisms in Efficient Pairing Based Systems
Frederik Vercauteren
2005
In this paper we examine the underlying hard problems in asymmetric pairings, their precise relationships and how they affect a…
(More)
Is this relevant?
2005
2005
Computably Enumerable Algebras, Their Expansions, and Isomorphisms
Bakhadyr Khoussainov
,
Steffen Lempp
,
Theodore A. Slaman
IJAC
2005
Computably enumerable algebras are the ones whose positive atomic diagrams are computably enumerable. Computable algebras are the…
(More)
Is this relevant?
Review
2000
Review
2000
Degree spectra of relations on computable structures
Denis R. Hirschfeldt
Bulletin of Symbolic Logic
2000
§0. Introduction. There has been increasing interest over the last few decades in the study of the effective content of…
(More)
Is this relevant?
1997
1997
Propositional Quantification in the Topological Semantics for S4
Philip Kremer
Notre Dame Journal of Formal Logic
1997
Fine and Kripke extended S5, S4, S4.2 and such to produce propositionally quantified systems S5π+, S4π+, S4.2π+: given a Kripke…
(More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract)
Stuart A. Kurtz
,
Stephen R. Mahaney
,
James S. Royer
STOC
1989
Berman and Hartmanis [BH77] conjectured that there is a polynomial-time computable isomorphism between any two languages m…
(More)
Is this relevant?