1. Andréka, H., Nemeti , I., & Nemeti, P. (2009). General relativistic hypercomputing and foundation of mathematics. Natural Computing, 8(3), 499-516.
2. Copeland, J. B. (1998). Even Turing machines can compute uncomputable functions. In C. Calude, Casti, John, & Dinneen, M. J. (Ed.), Unconventional Models of Computation, Lecture Notes in Computer Science (pp. 150-164). Springer.
3. Copeland, J. B. (1998). Super-Turing machines. Complexity, 4, 30-32.
4. Costa, J. (2012). Turing machines as clocks, rulers and randomizers. Boletim da Sociedade Portuguesa de Matematica(67), 121-153.
5. Davis, M. (2000). The Universal Computer, The Road from Leibniz to Turing. W. W. Norton and Company.