Issue No.11 - November (1977 vol.26)
K. Ecker , Gesellschaft f?r Mathematik und Datenverarbeitung
In this correspondence we discuss an application of a work measure introduced by Hellerman. Uniform machines are represented by chains of transformations of Boolean functions. The work of any transformation depends only on the rank of a corresponding Boolean matrix.
Boolean matrix, combinational complexity, combinational machine (logic circuit), computational work of processes, transformation of Boolean functions.
K. Ecker, D. Schutt, "Computational Work of Combinational Machines", IEEE Transactions on Computers, vol.26, no. 11, pp. 1161-1163, November 1977, doi:10.1109/TC.1977.1674768