Characterization and Cardinality of Universal Functions
Karl S. Menger · IEEE Transactions on Electronic Computers · 1965
Necessary and sufficient conditions that a Boolean function be universal, are established. It is demonstrated that most functions are in fact universal; thus, almost any function is a candidate for building the combinational logic of all computers.