Synthesis of a correct recognition algorithm as a minimal covering construction problem

Some methods of constructing correct recognition and classification algorithms, i.e., algorithms which make no mistakes when classifying given control data, are considered. The correct algorithm construction problem is shown to be reducible to thep problem of constructing the minimal covering of a set by a system of subsets. A practical way of constructing a correct algorithm was described.