In this paper we study several notions of approximability of functions in the framework of the BSS model. Denoting with φδ M the function computed by a BSS machine M when its comparisons are against -δ rather than 0, we study classes of functions f for which φδ M → f in some sense (pointwise, uniformly, etc.). The main equivalence results show that this notion coincides with Type 2 computability when the convergence speed is recursively bounded. Finally, we study the possibility of extending these results to computations over Archimedean fields.
CITATION STYLE
Meyssonnier, C., Boldi, P., & Vigna, S. (2001). δ-Approximable functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2064, pp. 187–199). Springer Verlag. https://doi.org/10.1007/3-540-45335-0_12
Mendeley helps you to discover research relevant for your work.