In order to develop systems capable of artificial evolution, we need to identify which systems can produce complex behavior. We present a novel classification method applicable to any …
As part of the comprehensive theme of the relationships between dynamic systems and computational theories, a very active area of research has been the relationships between …
B Wolnik, M Dembowski, W Bołt… - Journal of Physics A …, 2017 - iopscience.iop.org
The focus of this paper is on the density classification problem in the context of affine continuous cellular automata. Although such cellular automata cannot solve this problem in …
R Porter, N Bergmann - Simulated Evolution and Learning: Second Asia …, 1999 - Springer
Cellular Automata architectures are attractive due to their fine grain parallelism, simple computational structures and local routing resources. Some researchers have used genetic …
We present MergeLife, a genetic algorithm (GA) capable of evolving continuous cellular automata (CA) that generate full color dynamic animations according to aesthetic user …
PV Arun, SK Katiyar - GIScience & Remote Sensing, 2013 - Taylor & Francis
Automatic feature extraction has witnessed the use of many intelligent methodologies over the past decade. However, inadequate modelling of feature shape and contextual …
In the wild groups of hyenas are often observed to cooperate in driving lions away from a kill in order to claim it for themselves. Because lions are much larger and can easily injure or kill …
B Hudcová, T Mikolov - ALIFE 2021: The 2021 Conference on …, 2021 - direct.mit.edu
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable …
We consider the problem of evolving a particular kind of shift-invariant transformation– namely, Reversible Cellular Automata (RCA) defined by conserved landscape rules–using …