Random expansion method for the generation of complex cellular automata
From MaRDI portal
Publication:2666780
Abstract: The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic background. Frequently, this type of automata has been found through either an exhaustive search or a meticulous construction of the evolution rule. In this study, the specification of cellular automata with complex behaviors was obtained by utilizing randomly generated specimens. In particular, it proposed that a cellular automaton of states should be specified at random and then extended to another automaton with a higher number of states so that the original automaton operates as a periodic background where the additional states serve to define the gliders. Moreover, this study presented an explanation of this method. Furthermore, the random way of defining complex cellular automata was studied by using mean-field approximations for various states and local entropy measures. This specification was refined with a genetic algorithm to obtain specimens with a higher degree of complexity. With this methodology, it was possible to generate complex automata with hundreds of states, demonstrating that randomly defined local interactions with multiple states can construct complexity.
Recommendations
- Research of complexity in cellular automata through evolutionary algorithms
- Complex behavior in long-distance cellular automata
- Fractal arrangement for 2D cellular automata and its implementation in outer-totalistic rules
- Search of complex binary cellular automata using behavioral metrics
- scientific article; zbMATH DE number 1962073
Cites work
- A symbiosis between cellular automata and genetic algorithms
- A trade-off between simplicity and robustness? Illustration on a lattice-gas model of swarming
- Actin automata with memory
- Actin Automata: Phenomenology and Localizations
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Complex dynamics of elementary cellular automata emerging from chaotic rules
- Complexity steering in cellular automata
- Complexity. A guided tour
- Conservative computing in a one-dimensional cellular automaton with memory
- Emergence of density dynamics by surface interpolation in elementary cellular automata
- Game of life cellular automata
- Generative complexity of Gray-Scott model
- Glider collisions in hybrid cellular automata rule 168 and 133
- Glider implies Li-Yorke chaos for one-dimensional cellular automata
- scientific article; zbMATH DE number 6701939 (Why is no real title available?)
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 2188483 (Why is no real title available?)
- Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
- On patterns and dynamics of rule 22 cellular automaton
- On soliton collisions between localizations in complex elementary cellular automata: rules 54 and 110 and beyond
- On the complexity of the stability problem of binary freezing totalistic cellular automata
- On the dynamics of cellular automata with memory
- Phase Transitions of Cellular Automata
- Phenomenology of glider collisions in cellular automaton Rule 54 and associated logical gates
- Pulsing dynamics in randomly wired glider cellular automata
- Reachability problem in non-uniform cellular automata
- Search of complex binary cellular automata using behavioral metrics
- Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches
- Stochastic automated search methods in cellular automata: The discovery of tens of thousands of glider guns
- Symbolic dynamics of glider guns for some one-dimensional cellular automata
- Universality in elementary cellular automata
- Upper bound on the products of particle interactions in cellular automata
Cited in
(3)
This page was built for publication: Random expansion method for the generation of complex cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2666780)
