Estimating the Complexity of Algorithms for the Construction of Minimal Disjunctive Normal Forms of the Functions of the Algebra of Logic.

摘要

A definition was formulated in previous papers of a local information computing algorithm, and a study was made of the basic properties of such algorithms. The purpose of the present paper is to introduce the concept of calculability into the class of local algorithms, and to study the calculability of predicates which arise in the solution of problems involved in the construction of minimal disjunctive normal forms for functions of the algebra of logic. (Author)