Reliable Self-Replicating Machines in Asynchronous Cellular Automata

Authors:
Jia Lee;Susumu Adachi;Ferdinand Peper
Affiliations:
Tsukuba Advanced Research Alliance, University of Tsukuba, Tsukuba 305-8577, Japan and Japan Science and Technology Agency ( JST), CREST, Japan lijia@wslab.risk.tsukuba.ac.jp;-;-
Venue:
Artificial Life
Year:
2007

Citing 10
Cited 1

Cellular automata machines: a new environment for modeling

Cellular automata machines: a new environment for modeling
Toward a viable, self-reproducing universal computer

Physica D
Self-reproduction in three-dimensional reversible cellular space

Artificial Life
Self-Inspection Based Reproduction in Cellular Automata

Proceedings of the Third European Conference on Advances in Artificial Life
A New Self-Reproducing Cellular Automaton Capable of Construction and Computation

Proceedings of the Third European Conference on Advances in Artificial Life
Do artificial ants march in step? ordered asynchronous processes and modularity in biological systems

ICAL 2003 Proceedings of the eighth international conference on Artificial life
Evolution in asynchronous cellular automata

ICAL 2003 Proceedings of the eighth international conference on Artificial life
Embedding universal delay-insensitive circuits in asynchronous cellular spaces

Fundamenta Informaticae - Special issue on cellular automata
Delay-insensitive computation in asynchronous cellular automata

Journal of Computer and System Sciences
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Identifying patterns from one-rule-firing cellular automata

Artificial Life

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a self-replicating machine that is embedded in a two-dimensional asynchronous cellular automaton with von Neumann neighborhood. The machine dynamically encodes its shape into description signals, and despite the randomness of cell updating, it is able to successfully construct copies of itself according to the description signals. Self-replication on asynchronously updated cellular automata may find application in nanocomputers, where reconfigurability is an essential property, since it allows avoidance of defective parts and simplifies programming of such computers.