On functions correcting the sets of incorrect algorithms
Anvar Kabulov, Erkin Urunbaev, Aziz Ashurov
Abstract
In this paper, we consider special classes of corrective functions, sets of heuristic algorithms that allow errors in the calculation of elementary properties. The article solves the problem of logical separability for the correcting functions of multivalued logic. For not everywhere defined functions, the simplest, in a sense, extensions to the entire set are constructed in such a way that these extensions are everywhere defined functions of many-valued logic. When solving a wide class of practical problems, the algorithms are often used that allow errors in calculation of elementary properties or refusals to solve problems. In such cases, several incorrect algorithms are usually applied to solve a single problem, and then a corrective function is constructed.