Orbits of computably enumerable sets: Low sets can avoid an upper cone (Q1849863)

The author investigates the orbit of a low computably enumerable (c.e.) set under automorphisms of the partial order \({\mathcal E}\) of c.e. sets under inclusion, and it is proved that: For every low c.e. set \(A\) and every noncomputable c.e. set \(C\), there exists an automorphism of \({\mathcal E}\) mapping \(A\) to a set \(B\) such that \(C\nleqslant_TB\). Thus, the orbit of \(A\) cannot be contained in the upper cone above \(C\).