Abstract
A number-conserving cellular automaton (NCCA) is a cel lular automaton (CA) such that all states of cells are represented by integers and the total number of its configuration is conserved through- out its computing process. It can be thought as a kind of modelization of the physical conservation law of mass or energy. Although NCCAs with simple rules are studied widely, it is quite difficult to design NCCAs with complex transition rules. We show a condition for two-dimensional von Neumann neighbor NCCAs with special symmetric rules and we construct a logically universal NCCA and a self-reproducing NCCA by employing this condition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Boccara, N. and Fukś, H.: Number-conserving cellular automaton rules, Fundamenta Informaticae (to Appear).
Dewdney, A. K.: Computer recreations: the cellular automata programs that create wireworld, rugworld and other diversions, Scientific American Jan. (1990) 136–139.
Durand, B., Formenti, E. and Roka, Z.: Number conserving cellular automata: from decidability to dynamics, nlin.CG/0102035, (2001) (http://arxiv.org/list/nlin.CG/0102).
Frisch, U., Hasslacher, B. and Pomeau, Y.: Lattice-Gas Automata for the Navier-Stokes equation, Physical Review Letters 56 (1986) 1505–1508.
Hattori, T. and Takesue, S.: Additive conserved quantities in discrete-time lattice dynamical systems, Physica 49D (1991) 295–322.
Langton, C.G.: Self-reproduction in cellular automata, Physica10D(1984) 135–144.
Margolus, N.: Physics-like models of computation, Physica, 10D (1984) 81–95.
Morita, K. and Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata, Trans. IEICE Japan E72 (1989) 758–762.
Morita, K. and Imai, K.: Number-conserving reversible cellular automata and their computation-universality, Proceedings of MFCS’98 Workshop on Cellular Automata, Brno (1998) 51–68.
Nagel, K. and Schreckenberg, M.: A cellular automaton model for freeway traffic, Journal of Physics I,2 (1992) 2221–2229.
Tojima, Y.: Logic circuit composition on a two-dimensional three-state cellular automaton, Bachelor thesis, Hiroshima University (1997) (in Japanese).
Washio, T.: On self-reproduction in number-conserving reversible cellular automata, Bachelor thesis, Hiroshima University (1999) (in Japanese).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imai, K., Fujita, K., Iwamoto, C., Morita, K. (2002). Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-45833-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44311-7
Online ISBN: 978-3-540-45833-3
eBook Packages: Springer Book Archive