On self-embeddings of computable linear orderings (Q2576940)

The authors prove that there exists a computable linear ordering without nontrivial \({\mathbf 0}^\prime\)-computable self-embeddings. It appeared that the previously published proof of this statement in [\textit{S. Lempp, A. Morozov, C. McCoy} and \textit{D. R. Solomon}, ``On self-embeddings of computable linear orders'', in: S. B. Cooper et al. (eds.), Computability and models. Kluwer Academic/Plenum Publishers, New York, 259--265 (2003; Zbl 1104.03001)] contains an error. The question of how much computability we need to compute such embeddings in the general case and for various kinds of orderings is also studied.