Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
From MaRDI portal
Publication:272766
DOI10.1007/S11047-013-9376-7zbMath1352.68173OpenAlexW2089121815MaRDI QIDQ272766
Publication date: 21 April 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-013-9376-7
Related Items (5)
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations ⋮ A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates ⋮ From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
- Elements of a theory of computer simulation. I
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- Solution of some conjectures about topological properties of linear cellular automata
- Update schedules of sequential dynamical systems
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- Order Independence in Asynchronous Cellular Automata
- Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA
- Computing Issues of Asynchronous CA
This page was built for publication: Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
