Computably enumerable sets that are automorphic to low sets
Peter A. Cholak, Rachel Epstein · Computability · 2016
We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e. sets are autormorphic to low (or low2 ) sets. Using work of R. Miller, we can see that every