Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms

The problem of the recovery of a partially defined predicate on a metric compact of special form is considered. In a certain family of algorithms (for example, algorithms for computing estimates), an algorithm of the predicate evaluation is constructed, and its stability on the set of the recovery problems in a neighborhood of the given problem is proved. The lower bound for the stability radius of the algorithm constructed is computed.