© 2016, Springer Science+Business Media New York.It is proved that for every computable ordinal α, the Turing degree 0(α)is a degree of autostability of some computable Boolean algebra and is also a degree of autostability ...

In this survey, we discuss the theory of precomplete numberings, which appear frequently in computability theory. Precomplete numberings are closely related to some versions of the fixed-point theorem having an important ...