Approaches to complexity engineering
Physica D
Asynchronous mappings and asynchronous cellular automata
Information and Computation
Asynchronous automata versus asynchronous cellular automata
Theoretical Computer Science
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
Evolving Globally Synchronized Cellular Automata
Proceedings of the 6th International Conference on Genetic Algorithms
Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Safe Executions of Recognizable Trace Languages by Asynchronous Automata
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Reliable cellular automata with self-organization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On fireflies, cellular systems, and evolware
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
A study on learning robustness using asynchronous 1D cellular automata rules
Natural Computing: an international journal
| Hi-index | 0.00 |
One of the prominent features of the Cellular Automata (CA) model is its synchronous mode of operation, meaning that all cells are updated simultaneously. But this feature is far from being realistic from a biological point of view as well as from a computational point of view. Past research has mainly concentrated on studying Asynchronous CAs in themselves, trying to determine what behaviors were an "artifact" of the global clock. In this paper, I propose to evolve Asynchronous CAs that compute successfully one of the well-studied task for regular CAs: The synchronization task. As I will show evolved solutions are both unexpected and best for certain criteria.