1,134 research outputs found
Evolving localizations in reaction-diffusion cellular automata
We consider hexagonal cellular automata with immediate cell neighbourhood and
three cell-states. Every cell calculates its next state depending on the
integral representation of states in its neighbourhood, i.e. how many
neighbours are in each one state. We employ evolutionary algorithms to breed
local transition functions that support mobile localizations (gliders), and
characterize sets of the functions selected in terms of quasi-chemical systems.
Analysis of the set of functions evolved allows to speculate that mobile
localizations are likely to emerge in the quasi-chemical systems with limited
diffusion of one reagent, a small number of molecules is required for
amplification of travelling localizations, and reactions leading to stationary
localizations involve relatively equal amount of quasi-chemical species.
Techniques developed can be applied in cascading signals in nature-inspired
spatially extended computing devices, and phenomenological studies and
classification of non-linear discrete systems.Comment: Accepted for publication in Int. J. Modern Physics
Failover in cellular automata
A cellular automata (CA) configuration is constructed that exhibits emergent
failover. The configuration is based on standard Game of Life rules. Gliders
and glider-guns form the core messaging structure in the configuration. The
blinker is represented as the basic computational unit, and it is shown how it
can be recreated in case of a failure. Stateless failover using primary-backup
mechanism is demonstrated. The details of the CA components used in the
configuration and its working are described, and a simulation of the complete
configuration is also presented.Comment: 16 pages, 15 figures and associated video at
http://dl.dropbox.com/u/7553694/failover_demo.avi and simulation at
http://dl.dropbox.com/u/7553694/failover_simulation.ja
Cellular automaton supercolliders
Gliders in one-dimensional cellular automata are compact groups of
non-quiescent and non-ether patterns (ether represents a periodic background)
translating along automaton lattice. They are cellular-automaton analogous of
localizations or quasi-local collective excitations travelling in a spatially
extended non-linear medium. They can be considered as binary strings or symbols
travelling along a one-dimensional ring, interacting with each other and
changing their states, or symbolic values, as a result of interactions. We
analyse what types of interaction occur between gliders travelling on a
cellular automaton `cyclotron' and build a catalog of the most common
reactions. We demonstrate that collisions between gliders emulate the basic
types of interaction that occur between localizations in non-linear media:
fusion, elastic collision, and soliton-like collision. Computational outcomes
of a swarm of gliders circling on a one-dimensional torus are analysed via
implementation of cyclic tag systems
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
Lenia and Expanded Universe
We report experimental extensions of Lenia, a continuous cellular automata
family capable of producing lifelike self-organizing autonomous patterns. The
rule of Lenia was generalized into higher dimensions, multiple kernels, and
multiple channels. The final architecture approaches what can be seen as a
recurrent convolutional neural network. Using semi-automatic search e.g.
genetic algorithm, we discovered new phenomena like polyhedral symmetries,
individuality, self-replication, emission, growth by ingestion, and saw the
emergence of "virtual eukaryotes" that possess internal division of labor and
type differentiation. We discuss the results in the contexts of biology,
artificial life, and artificial intelligence.Comment: 8 pages, 5 figures, 1 table; submitted to ALIFE 2020 conferenc
A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
Cellular automata (CAs) are dynamical systems which exhibit complex global
behavior from simple local interaction and computation. Since the inception of
cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention
of several researchers over various backgrounds and fields for modelling
different physical, natural as well as real-life phenomena. Classically, CAs
are uniform. However, non-uniformity has also been introduced in update
pattern, lattice structure, neighborhood dependency and local rule. In this
survey, we tour to the various types of CAs introduced till date, the different
characterization tools, the global behaviors of CAs, like universality,
reversibility, dynamics etc. Special attention is given to non-uniformity in
CAs and especially to non-uniform elementary CAs, which have been very useful
in solving several real-life problems.Comment: 43 pages; Under review in Natural Computin
- …