delta-Approximable Functions

Authors:
Charles Meyssonnier;Paolo Boldi;Sebastiano Vigna
Affiliations:
-;-;-
Venue:
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Year:
2000

Citing 9
Cited 0

On the relations between distributive computability and the BSS model

Theoretical Computer Science - Special issue on real numbers and computers
A domain-theoretic approach to computability on the real line

Theoretical Computer Science - Special issue on real numbers and computers
&dgr;-uniform BSS machines

Journal of Complexity
Feasible real random access machines

Journal of Complexity
Analytic machines

Theoretical Computer Science - Special issue on computability and complexity in analysis
On approximate and algebraic computability over the real numbers

Theoretical Computer Science - Special issue on computability and complexity in analysis
Computation by “while” programs on topological partial algebras

Theoretical Computer Science - Special issue on computability and complexity in analysis
The Turing closure of an archimedean field

Theoretical Computer Science - Special issue on universal machines and computations
Computable analysis: an introduction

Computable analysis: an introduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.