1. B. Seyfferth and P. Koepke, “Towards a theory of infinite time Blum–Shub–Smale machines,” Lect. Notes Comp. Sci., 7318, Springer, Berlin (2012), pp. 405-415.
2. P. Koepke and A. Morozov, “On the computational strength of infinite time Blum–Shub–Smale machines,” in Turing Centenary Conference 2012: How the World Computes (University of Cambridge, 18-23 June, 2012), Abstracts of informal presentations, Univ. Cambridge (2012).
3. P. Koepke and A. Morozov, “The computational power of infinite time Blum–Shub–Smale machines,” Algebra and Logic, Vol. 56, No. 1, 37-62 (2017).
4. P. Welch, “Transfinite machine models,” in Lect. Notes Log., Cambridge, 42, Cambridge Univ. Press, Cambridge (2014), pp. 493-529.
5. P. D. Welch, “Discrete transfinite computation,” in Turing’s Revolution. The Impact of His Ideas about Computability, G. Sommarugaet al. (Eds.), Springer, Cham (2015), pp. 161-185.