On the Orbits of Computable Enumerable Sets

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 1-complete. 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)