Combinatory logic [1] is universal and needs only 2 primitive combinators, S and K, as well as an application operator. So 3 operators suffice for completeness

Combinatory logic [1] is universal and needs only 2 primitive combinators, S and K, as well as an application operator. So 3 operators suffice for completeness without any convoluting. [1] https://en.wikipedia.org/wiki/Combinatory_logic https://en.wikipedia.org/wiki/Combinatory_logic