Results 1 
6 of
6
Extension theorems, orbits, and automorphisms of the computably enumerable sets
 TRANS. AMER. MATH. SOC.
, 2008
"... We prove an algebraic extension theorem for the computably enumerable sets, E. Using this extension theorem and other work we then show if A and � A are automorphic via Ψ, then they are automorphic via Λ where Λ ↾ L ∗ (A) =ΨandΛ↾E ∗ (A) is∆0 3. We give an algebraic description of when an arbitrary ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We prove an algebraic extension theorem for the computably enumerable sets, E. Using this extension theorem and other work we then show if A and � A are automorphic via Ψ, then they are automorphic via Λ where Λ ↾ L ∗ (A) =ΨandΛ↾E ∗ (A) is∆0 3. We give an algebraic description of when an arbitrary set �A is in the orbit of a computably enumerable set A. We construct the first example of a definable orbit which is not a ∆0 3 orbit. We conclude with some results which restrict the ways one can increase the complexity of orbits. For example, we show that if A is simple and �A is in the same orbit as A, then they are in the same ∆0 6orbit and, furthermore, we provide a classification of when two simple sets are in the same orbit.
Isomorphisms Of Splits Of Computably Enumerable Sets
 J. OF SYMBOLIC LOGIC
, 2002
"... We show that if A and A are automorphic via # then the structures SR (A) and SR ( 3 isomorphic via an isomorphism # induced by #. Then we use this result to classify completely the orbits of hhsimple sets. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We show that if A and A are automorphic via # then the structures SR (A) and SR ( 3 isomorphic via an isomorphism # induced by #. Then we use this result to classify completely the orbits of hhsimple sets.
On the Orbits of Computable Enumerable Sets
, 2007
"... The goal of this paper is to show 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; th ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The goal of this paper is to show 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).
Invariance in E ∗ and EΠ
 Trans. Amer. Math. Soc
"... Abstract. We define G, a substructure of EΠ (the lattice of Π 0 1 classes) and show that a quotient structure of G, G ♦ , is isomorphic to E ∗. The result builds on the ∆ 0 3 isomorphism machinery, and allows us to transfer invariant classes from E ∗ to EΠ, though not, in general, orbits. Further pr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We define G, a substructure of EΠ (the lattice of Π 0 1 classes) and show that a quotient structure of G, G ♦ , is isomorphic to E ∗. The result builds on the ∆ 0 3 isomorphism machinery, and allows us to transfer invariant classes from E ∗ to EΠ, though not, in general, orbits. Further properties of G ♦ and ramifications of the isomorphism are explored, including degrees of equivalence classes and degree invariance. 1.
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