8 citations · 11 across the 4 of their papers we have counts for
4 papers
The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
Leo A. Harrington, Peter M. Gerdes
This paper finally fully elaborates the tree pulldown method used by one of us (Harrington) to settle McLaughlin's conjecture. This method enables the construction of a computable…
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 -complete. This re…
On the Orbits of Computably Enumerable Sets
Peter Cholak, Rod Downey, Leo Harrington
The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, , such that the question of membership in this orbit is -complete. Th…
Extensions Theorems, Orbits, and Automorphisms of the Computably Enumerable Sets
Peter Cholak, Leo Harrington
We prove an algebraic extension theorem for the computably enumerable sets, . Using this extension theorem and other work we then show if and are automor…