Reliable self-replicating machines in asynchronous cellular automata

Artif Life. 2007 Fall;13(4):397-413. doi: 10.1162/artl.2007.13.4.397.

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.

MeSH terms

  • Algorithms*
  • Automation*
  • Computer Simulation*
  • Models, Theoretical*
  • Software*