Computation of nonrecurrent ordered Boolean functions of higher than the second order

In the design. and development of modern means of ADP equipment, much attention is being given to the hardware support of mass data processing using various task-oriented processors. A distinctive feature of these specialized processors is that operational algorithms of the systems under design are realized based on multifunctional logic modules (MLM) that can be adjusted to any particular logic algorithm from the given class. The non-recurrent Boolean functions were classified by Shidlovskiy et al. (2001), where the MLM for computation of nonrecurrent Boolean functions represented both in the disjunction and conjuction normal forms (DNF and CNF) were examined. The present work gives the results of investigations into a problem of developing the MLM that allow isotropic media for computation of higher-order Boolean functions to be constructed. By the MLM (module) an adjustable automaton is meant for which its output values depend only on the values of its input signals irrespective of the adjustment