Hostname: page-component-7479d7b7d-q6k6v Total loading time: 0 Render date: 2024-07-10T19:19:32.708Z Has data issue: false hasContentIssue false
  • English
  • Français

Number-Conserving Reversible Cellular Automata and Their Computation-Universality

Published online by Cambridge University Press:  15 April 2002

Kenichi Morita  and
Katsunobu Imai
Kenichi Morita
Affiliation:
Hiroshima University, Faculty of Engineering, Higashi-Hiroshima 739-8527, Japan; e-mail: morita@iec.hiroshima-u.ac.jp
Katsunobu Imai
Affiliation:
Hiroshima University, Faculty of Engineering, Higashi-Hiroshima 739-8527, Japan; e-mail: imai@iec.hiroshima-u.ac.jp
Get access

Abstract

We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible version of NC-PCA, and prove that a reversible NC-PCA is computation-universal. It is proved by showing that a reversible two-counter machine, which has been known to be universal, can be simulated by a reversible NC-PCA.

Keywords

Cellular automatareversibilityconservation lawuniversality.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 35 , Issue 3 , May 2001 , pp. 239 - 258
Copyright
© EDP Sciences, 2001

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

Albert, J. and Culik II, K., A simple universal cellular automaton and its one-way and totalistic version. Complex Systems 1 (1987) 1-16.
Bennett, C.H., Logical reversibility of computation. IBM J. Res. Dev. 17 (1973) 525-532. CrossRef
Bennett, C.H., Notes on the history of reversible computation. IBM J. Res. Dev. 32 (1988) 16-23. CrossRef
Fredkin, E. and Toffoli, T., Conservative logic. Int. J. Theoret. Phys. 21 (1982) 219-253. CrossRef
Goles, E., Sand pile automata. Ann. Inst. H. Poincaré 56 (1992) 75-90.
Goles, E. and Margenstern, M., Sand pile as a universal computer. Int. J. Modern Physics C 7 (1996) 113-122. CrossRef
K. Imai and K. Morita, A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theoret. Comput. Sci. (in press).
Margolus, N., Physics-like model of computation. Physica D 10 (1984) 81-95. CrossRef
K. Morita and M. Harao, Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE Japan E-72 (1989) 758-762.
K. Morita and S. Ueno, Computation-universal models of two-dimensional 16-state reversible cellular automata. IEICE Trans. Inf. & Syst. E75-D (1992) 141-147.
Morita, K., Computation-universality of one-dimensional one-way reversible cellular automata. Inform. Process. Lett. 42 (1992) 325-329. CrossRef
Morita, K., Universality of a reversible two-counter machine. Theoret. Comput. Sci. 168 (1996) 303-320. CrossRef
Toffoli, T., Computation and construction universality of reversible cellular automata. J. Comput. Syst. Sci. 15 (1977) 213-231. CrossRef
Toffoli, T. and Margolus, N., Invertible cellular automata: A review. Physica D 45 (1990) 229-253. CrossRef