Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Introduction of structural dissolution into Langton's self-reproducing loop
ALIFE Proceedings of the sixth international conference on Artificial life
Integration of the Phase-Difference Relations in Asynchronous Sequential Networks
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Self-Reproduction in Asynchronous Cellular Automata
EH '02 Proceedings of the 2002 NASA/DoD Conference on Evolvable Hardware (EH'02)
Cellular Automata
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Automatic discovery of self-replicating structures in cellularautomata
IEEE Transactions on Evolutionary Computation
Evolving genetic regulatory networks using an artificial genome
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
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
An Asynchronous Cellular Automata-Based Adaptive Illumination Facility
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
A cellular automata-based modular lighting system
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Computational aspects of asynchronous cellular automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Cell dormancy in cellular automata
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Self-replication, evolvability and asynchronicity in stochastic worlds
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
A study on learning robustness using asynchronous 1D cellular automata rules
Natural Computing: an international journal
Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces
Fundamenta Informaticae - Cellular Automata
Computers and Electrical Engineering
Computing Issues of Asynchronous CA
Fundamenta Informaticae
Hi-index | 0.00 |
Building on the work of Von Neumann, Langton, and Sayama among others, we introduce the first examples of evolution in populations of self-reproducing configurations in asynchronous cellular automata. Reliance on a global synchronous update signal has been a limitation of all solutions since the problem of achieving self-production in cellular automata was first attacked by Von Neumann half a century ago. Results of the author obviate the need for this restriction.We review our simple constructive mechanism to transform any cellular automata network with synchronous update into one with essentially the same behavior but whose cells may be updated randomly and asynchronously. The generality of this mechanism is guaranteed by a general mathematical theorem that any synchronous cellular automata configuration and rule can be realized asynchronously in such a way that the behavior of the original synchronous cellular automata can be completely recovered from that of the corresponding asynchronous cellular automaton, in which temporal synchronization locally stays within small tolerances.It follows that most results on self-reproduction, universal computation and construction, and evolution in populations of self-reproducing configurations in cellular automata that have been obtained in the past carry over to the asynchronous domain using the method described here.Here we discuss requirements for evolutionary systems in cellular automata and describe implemented examples of our procedure applied to a variety of self-reproducing systems (Byl, Reggia et al., Langton, Sayama).In particular, we have implemented Sayama's evo-loop system asynchronously, giving the first example of evolution in asynchronous cellular automata.