Results 1 
3 of
3
The isomorphism problem for torsionfree abelian groups is analytic complete
 JOURNAL OF ALGEBRA
, 2008
"... We prove that the isomorphism problem for torsionfree Abelian groups is as complicated as any isomorphism problem could be in terms of the analytical hierarchy, namely Σ 1 1 complete. ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
We prove that the isomorphism problem for torsionfree Abelian groups is as complicated as any isomorphism problem could be in terms of the analytical hierarchy, namely Σ 1 1 complete.
The complexity of orbits of computably enumerable sets
 BULLETIN OF SYMBOLIC LOGIC
, 2008
"... The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is Σ1 1complete. This result and proof have a number of nice corollaries: the Scott rank of E is ωCK 1 + 1; not all orbits are elementarily definable; ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is Σ1 1complete. This result and proof have a number of nice corollaries: the Scott rank of E is ωCK 1 + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of E; for all finite α ≥ 9, there is a properly ∆0 α orbit (from the proof).
Computability Theory, Algorithmic Randomness and Turing’s Anticipation
"... Abstract. This article looks at the applications of Turing’s Legacy in computation, particularly to the theory of algorithmic randomness, where classical mathematical concepts such as measure could be made computational. It also traces Turing’s anticipation of this theory in an early manuscript. 1 ..."
Abstract
 Add to MetaCart
Abstract. This article looks at the applications of Turing’s Legacy in computation, particularly to the theory of algorithmic randomness, where classical mathematical concepts such as measure could be made computational. It also traces Turing’s anticipation of this theory in an early manuscript. 1