1. Benci, V., Bonanno, C., Galatolo, S., Menconi, G., Virgilio, M. Dynamical systems and computable information, Preprint in Physics cond-mat/0210654, 2002 (electronic edition: http://arXiv.org )
2. Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21(1), 1–46 (1989)
3. Burgin, M.S.: Inductive Turing machines. Not. Acad. Sci. USSR 27(3), 1289–1293 (1983)
4. Burgin, M.S.: Generalized Kolmogorov complexity and other dual complexity measures. Cybern. Syst. Anal. 26(4), 481–490 (1990)
5. Burgin, M.: Super-recursive algorithms as a tool for high performance computing. In: Proceedings of the High Performance Computing Symposium, pp. 224–228. San Diego (1999)