On the Completeness of Classes of Correcting Functions of Heuristic Algorithms

We study classes of monotone k-valued corrective functions that preserve values when heuristic algorithms make the correct decision, defined on a certain subset of sets of n-dimensional k-valued lattice S n and corrective sets of heuristic algorithms for solving problems from poorly formalized areas.To completely solve the problem of constructing the simplest continuation in classes of corrective functions, theorems on the completeness of classes of monotone k-valued functions and functions preserving sets of S n for k = 3 are proved, and also bases are created in the given classes.