The Riesz Representation Operator on the Dual of C[0;1] is Computable
A computable version is proved in [Lu and Weihrauch(2007)]: a function g can be computed from F and its norm, and F can be computed from g and an upper bound of its total variation. In this article we present a much more transparent proof. We first give a new proof of the classical theorem from which we then can derive the computable version easily. As in [Lu and Weihrauch(2007)] we use the framework of TTE, the representation approach for computable analysis, which allows to define natural concepts of computability for the operators under consideration.
computable analysis riesz representation theorem