1. Goncharov S.S. and Sorbi A., “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra Logic, vol. 36, no. 6, 359–369 (1997).
2. Ershov Yu.L., The Theory of Enumerations, Nauka, Moscow (1977) [Russian].
3. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, St. Louis, San Francisco, Toronto, London, and Sydney (1967).
4. Soare R.I., Turing Computability, Theory and Applications, Springer, Berlin (2016).
5. Cooper S.B., “Enumeration reducibility, nondeterministic computations and relative
computability of partial functions,” in: Recursion Theory Week, Springer, Berlin and Heidelberg (1990), 57–110 (Lecture Notes Math.; vol. 1432).