Computing issues of asynchronous CA
From MaRDI portal
Recommendations
- Towards intrinsically universal asynchronous CA
- What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity
- scientific article; zbMATH DE number 4068287
- A guided tour of asynchronous cellular automata
- An analysis of different types and effects of asynchronicity in cellular automata update schemes
Cited in
(43)- Computations on one-dimensional cellular automata
- Complexity of sequential realization of cellular automata maps
- Supercritical probabilistic cellular automata: how effective is the synchronous updating?
- Dynamical behavior of additive cellular automata over finite abelian groups
- Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata
- Fixing monotone Boolean networks asynchronously
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Implantation of cellular automata
- Complexity of the dynamics of reaction systems
- Foreword: Asynchronous cellular automata and nature-inspired computation
- An analysis of different types and effects of asynchronicity in cellular automata update schemes
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Towards intrinsically universal asynchronous CA
- m-asynchronous cellular automata: from fairness to quasi-fairness
- Computation of functions on n bits by asynchronous clocking of cellular automata
- Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood
- A guided tour of asynchronous cellular automata
- Synchronous versus asynchronous cellular automata for simulating nano-systems kinetics
- Cellular automata -- a computational point of view
- Asynchronous cellular automata and Brownian motion
- scientific article; zbMATH DE number 4068287 (Why is no real title available?)
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
- Three research directions in non-uniform cellular automata
- What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity
- Computing by temporal order: asynchronous cellular automata
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Swarm Intelligence
- Computational complexity of finite asynchronous cellular automata
- Computational aspects of asynchronous cellular automata
- Universal Construction on Self-Timed Cellular Automata
- Randomized Computation with Cellular Automata
- Characterizing Configuration Spaces of Simple Threshold Cellular Automata
- Turing-completeness of asynchronous non-camouflage cellular automata
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA
- On the simulation power of surface chemical reaction networks
- Cellular automata on spaces of probability measures
- On the composition of cellular automata
- Construction universality in purely asynchronous cellular automata
This page was built for publication: Computing issues of asynchronous CA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902304)
