Universal threshold gates for 3-, 4- and 5-variable linearly separable (threshold) functions

Abstract

The number of different possible linearly separable Boolean functions of n variables is given by the permutations of the n+1 Chow parameters. For n = 3, 4 and 5, single universal-gate design specifications are disclosed, which will realise all such possible linearly separable functions. It is suggested that practical factors preclude the building of universal functions for n > 5.