“…The minimum amount of the required information to solve a specific task with the specified degree of reliability (global radius of information) can be defined as follows. If we accept that (7) and note 8as a local radius of information, i.e., the least ξ, for which there still exists an element belonging to sets for all that do not differ from f using information N, then the global radius of information may be defined as (9) Then for the exact solution of the problem, i.e., for the case of an unambiguous definition (10) when S[V(N,f)] is unique (one and only one), (11) Thus, the search for an exact solution to a problem reduces to the definition of the minimum amount of information, the presence of which r(N) is converted to zero. However, since the procedures for such a search are often limited to system resources, or too high for additional information, the decision is sought with an error (12) where -the local error in the algorithm (procedures) φ from the class of algorithms (procedures) φ(N) that use the information N, i.e., the least ξ, in which the element φ[N (f)] belongs to for all that cannot be distinguished from f by using information N.…”