Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441)

We define the notion of rational presentation of a complete metric space, in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some representations of the space \(C[0,1]\) of uniformly continuous real functions over \([0,1]\) with the usual norm: \(|f|_{\infty} = \text{Sup}\{|f(x)|\); \(0<x<1\}\). This allows us to have a comparison of global kind between complexity notions attached to these presentations. In particular, we get a generalization of Hoover's results concerning the Weierstrass approximation theorem in polynomial time. We get also a generalization of previous results on analytic functions which are computable in polynomial time.