Quarterly (winter, spring, summer, fall)
128 pp. per issue
7 x 10, illustrated
2014 Impact factor:

Artificial Life

Fall 2007, Vol. 13, No. 4, Pages 397-413
(doi: 10.1162/artl.2007.13.4.397)
© 2007 Massachusetts Institute of Technology
Reliable Self-Replicating Machines in Asynchronous Cellular Automata
Article PDF (279.46 KB)

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.