Three generators for minimal writing-space computations
We construct, for each integer , three functions from {0,1} to {0,1} such that any boolean mapping from {0,1} to {0,1} can be computed with a finite sequence of assignations only using the input variables and those three functions.
Page 1