Abstract
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are performed by storing a dedicated program (sequence of states) on self-replicating loops, and letting the loops retrieve the operands, exchange data among themselves, and perform the calculations according to a set of rules. To determine the rules required for addition and multiplication, we exploited an existing algorithm for computation in the cellular automata environment and adapted it to exploit the features of self-replicating loops. This approach allowed us to study a variety of issues (synchronization, data exchange, etc.) related to the use of self-replicating machines for complex operations.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. von Neumann. The Theory of Self-Reproducing Automata. A. W. Burks, ed. University of Illinois Press, Urbana, IL, 1966.
E.R. Banks. “Universality in Cellular Automata”. In Proc. IEEE 11th Annual Symposium on Switching and Automata Theory, Santa Monica, CA, October 1970, pp. 194–215.
E.F. Codd. Cellular Automata. Academic Press, New York, 1968.
C. Lee. “Synthesis of a Cellular Computer”. In Applied Automata Theory, Academic Press, London, 1968, pp 217–234.
C. G. Langton. “Self-Reproduction in Cellular Automata”. Physica 10D, 1984, pp. 135–144.
J. Byl. “Self-Reproduction in Small Cellular Automata”. Physica 34D, pp.295–299, 1989.
J.A. Reggia, S.A. Armentrout, H.-H. Chou, Y. Peng. “Simple Systems That Exhibit Self-Directed Replication”. Science, Vol.259, 26 February 1993, pp. 1282–1287.
D. Mange, M. Tomassini, eds. Bio-inspired Computing Machines: Towards Novel Computational Architectures. Presses Polytechniques et Universitaires Romandes, Lausanne, Switzerland, 1998.
D. Mange, M. Goeke, D. Madon, A. Stauffer, G. Tempesti, S. Durand. “Embryonics: A New Family of Coarse-Grained Field-Programmable Gate Array with Self-Repair and Self-Reproducing Properties”. In E. Sanchez, M. Tomassini, eds., Towards Evolvable Hardware, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 197–220.
G. Tempesti. A Self-Repairing Multiplexer-Based FPGA Inspired by Biological Processes. Ph.D. Thesis No. 1827, EPFL, Lausanne, 1998.
G. Tempesti, D. Mange, A. Stauffer. “Self-Replicating and Self-Repairing Multicellular Automata”. Artificial Life, 4(3), 1998, pp. 259–282.
J.-Y. Perrier, M. Sipper, J. Zahnd. “Toward a Viable, Self-Reproducing Universal Computer”. Physica 97D, pp. 335–352, 1996.
G. Tempesti. “A New Self-Reproducing Cellular Automaton Capable of Construction and Computation”. Proc. 3rd European Conference on Artificial Life, Lecture Notes in Artificial Intelligence, 929, Springer Verlag, Berlin, 1995, pp. 555–563.
K. Steiglitz, R. K. Squier, M. H. Jakubow. “Programmable Parallel Arithmetic in Cellular Automata using a Particle Model”. Complex Systems 8, 1994, pp. 311–323.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petraglio, E., Henry, JM., Tempesti, G. (1999). Arithmetic Operations on Self-Replicating Cellular Automata. In: Floreano, D., Nicoud, JD., Mondada, F. (eds) Advances in Artificial Life. ECAL 1999. Lecture Notes in Computer Science(), vol 1674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48304-7_62
Download citation
DOI: https://doi.org/10.1007/3-540-48304-7_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66452-9
Online ISBN: 978-3-540-48304-5
eBook Packages: Springer Book Archive