Parallel computations and committee constructions

The paper reviewed the results bearing out the deep-seated relation between the parallel computations and learning procedures for the laminated neural networks one of whose formalizations is represented by the theory of committee constructions. Additionally, consideration was given to two combinatorial problems concerned with learning pattern recognition in the class of affine committees – the problem of verifying existence of a three-element affine separating committee and that of element-minimal affine separating committee. The first problem was shown to be $NP$-complete, whereas the second problem is $NP$-hard and does not belong to the Apx class.