A generalized solution operator is a mapping abstractly describing a computational problem and its approximate solutions. It assigns a set of $$\varepsilon $$ε-approximations of a solution to the problem instance… Click to show full abstract
A generalized solution operator is a mapping abstractly describing a computational problem and its approximate solutions. It assigns a set of $$\varepsilon $$ε-approximations of a solution to the problem instance f and accuracy of approximation $$\varepsilon $$ε. In this paper we study generalized solution operators for which the accuracy of approximation is described by elements of a complete lattice equipped with a compatible monoid structure, namely, a quantale. We provide examples of computational problems for which the accuracy of approximation of a solution is measured by such objects. We show that the sets of $$\varepsilon $$ε-approximations are, roughly, closed balls with radii $$\varepsilon $$ε with respect to a certain family of quantale-valued generalized metrics induced by a generalized solution operator.
               
Click one of the above tabs to view related content.