The Complexity of Orbits of Computably Enumerable Sets

Peter A. Cholak, Rod Downey, Leo Harrington

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 ${\Sigma }_1^1$-complete. This re…