Real recursive functions and their hierarchy

  • Authors:

  • Jerzy Mycka;José Félix Costa

  • Affiliations:

  • Department of Mathematics, University of Maria Curie-Sklodowska, Pl. M. Curie-Sklodowskiej 1, Lublin 20-031, Poland;Department of Mathematics, I.S.T., Universidade Técnica de Lisboa, Lisboa, Portugal

  • Venue:
  • Journal of Complexity
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes (Unconventional Models of Computation, UMC 2002, Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, pp. 1-14). However, one of the operators introduced in the seminal paper by Moore (1996), the minimalization operator, has not been considered: (a) although differential recursion (the analog counterpart of classical recurrence) is, in some extent, directly implementable in the General Purpose Analog Computer of Claude Shannon, analog minimalization is far from physical realizability, and (b) analog minimalization was borrowed from classical recursion theory and does not fit well the analytic realm of analog computation. In this paper, we show that a most natural operator captured from analysis--the operator of taking a limit--can be used properly to enhance the theory of recursion over the reals, providing good solutions to puzzling problems raised by the original model.