We prove that a computably enumerable set A is effectively speedable (effectively levelable) if and only if there exists a splitting (A_0,A_1) of A such that both A_0 and A_1 are effectively speedable (effectively levelable). These results answer two questions raised by J. B. Remmel.
展开▼
机译：我们证明，当且仅当存在A的分裂（A_0，A_1）使得A_0和A_1都可以有效地加速（有效地平准化）时，可计算的集合A才有效地加速（有效地平准化）。这些结果回答了J. B. Remmel提出的两个问题。
展开▼
