Remarks on simulation of Boolean functions
Recently M. Morris Mano presented a method for performing Boolean OR, AND and NOT operations by means of arithmetic and conditional transfer operations in a decimal computer lacking builtin logical instructions [1]. When <italic>A</italic>, <italic>B</italic>, <italic>C</italic> are variables whose defined value is 0 or 1 and <italic>a</italic>, <italic>b</italic>, <italic>c</italic> are the corresponding integer variables with values 0 or 1, his Boolean OR was defined by:
“The result of an OR operation of Boolean variables is the same as the arithmetic addition of the <italic>a</italic>, <italic>b</italic>, <italic>c</italic> integer variables after which the following test is made: (a) If the sum is equal to zero, the result is correct; (b) If the sum is larger than zero, the answer is 1.”