Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-23T20:08:39.076Z Has data issue: false hasContentIssue false
  • English
  • Français

Three generators for minimal writing-space computations

Published online by Cambridge University Press:  15 April 2002

Serge Burckel  and
Marianne Morillon
Serge Burckel
Affiliation:
Département de Mathématiques et d'Informatique, 15 avenue René Cassin, Université de la Réunion, 97490 Saint-Denis, France; ([email protected])
Marianne Morillon
Affiliation:
Département de Mathématiques et d'Informatique, 15 avenue René Cassin, Université de la Réunion, 97490 Saint-Denis, France; ([email protected])
Get access

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.

Keywords

Boolean functionsmodels of computations.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 2 , March 2000 , pp. 131 - 138
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

de Bruijn, N.G., A combinatorial problem. Indag. Math. 8 (1946) 461-467.
Burckel, S., Closed Iterative Calculus. Theoret. Comput. Sci. 158 (1996) 371-378. CrossRef
S. Burckel and M. Morillon, Computing Without Copying (submitted).
Piccard, S., Sur les fonctions définies dans les ensembles finis quelconques. Fund. Math. 24 (1935) 298-301.