A study on learning robustness using asynchronous 1D cellular automata rules
From MaRDI portal
Publication:2629939
DOI10.1007/S11047-012-9311-3zbMath1339.68180OpenAlexW2011689134WikidataQ57518462 ScholiaQ57518462MaRDI QIDQ2629939
Leonardo Vanneschi, Giancarlo Mauri
Publication date: 8 July 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-012-9311-3
Learning and adaptive systems in artificial intelligence (68T05) Cellular automata (computational aspects) (68Q80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast parallel language recognition by cellular automata
- Reliable computation with cellular automata
- A simple three-dimensional real-time reliable cellular array
- Synchronous versus asynchronous dynamics in spatially distributed systems
- Co-evolving non-uniform cellular automata to perform computations
- Real-time language recognition by one-dimensional cellular automata
- Robustness of Cellular Automata in the Light of Asynchronous Information Transmission
- Large deviations for mean field models of probabilistic cellular automata
- Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority
- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
- Probabilistic cellular automata with conserved quantities
- A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms
- Cellular Automata Modeling of Physical Systems
- Mathematical Foundations of Computer Science 2005
- Reliable cellular automata with self-organization
This page was built for publication: A study on learning robustness using asynchronous 1D cellular automata rules
