Evolution in asynchronous cellular automata by Nehaniv, C. L. (2003)

tags
Cellular automata, Evolution
source
(Nehaniv 2003)

Summary

This paper proposes a general asynchronous extension of CA rules and show that they can be made equivalent to the original CA rule. Applying this extension to H. Sayama’s Evoloop cellular automaton (Sayama 1999), the author creates the first asynchronous implementation of evolution of self-replicators.

One hope formulated by the author is that asynchronicity could help achieve fault-tolerance and self-repair.

Bibliography

Nehaniv, Chrystopher L. 2003. “Evolution in Asynchronous Cellular Automata.” In Proceedings of the Eighth International Conference on Artificial Life, 65–73.

Sayama, H. 1999. “A New Structurally Dissolvable Self-Reproducing Loop Evolving in a Simple Cellular Automata Space.” Artificial Life 5 (4):343–65.


← Back to Notes