ABSTRACT
The classical way to solve a problem of numerical analysis relies on a rigorous algorithm, which, for a given input, provides a well-defined solution in a predetermined number of steps. Such an approach is essentially deterministic, in the sense that its implementation is expected to lead on repeated runs, upon completion of the same number of operations, to the same result. Still, for numerous topical problems in applied sciences and engineering, the complexity of deterministic algorithms renders the computations intractable within reasonable amounts of time.
