One Method of Synthesing Normal Forms

Abstract

Many practical problems of combinatory synthesis which arise today cannot be solved by methods which entail deterministic exhaustive scanning if one has minimization in mind. The fact of the matter is that the output functions, which depend on a large number of arguments, turn out not to be defined everywhere, with the points of indeterminacy of these functions also being quite numerous (and, it would seem there is a tendency for these parameters to increase). The necessity therefore arises of developing methods of approximate minimization, reducing the requisite exhaustive scanning on the basis of certain probabilistic criteria.