Article contents
Three generators for minimal writing-space computations
Published online by Cambridge University Press: 15 April 2002
Abstract
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 with a finite sequence of assignations only using the n input variables and those three functions.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2000
References
- 3
- Cited by