We construct, for each integer n, three functions from {0, 1}(n) to {0, 1}
such that any boolean mapping from {0, 1}(n) to {0, 1}(n) can be computed w
ith a finite sequence of assignations only using the n input variables and
those three functions.
AMS Subject Classification. 68Q, 06E30, 03D15.