Computing by temporal order: asynchronous cellular automata

MaRDI QIDQ4986314zbMATH OpenFDO

Authors Michael Vielhaber

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2762, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AUTOJAC2012.14

zbMATH Keywords

asynchronouscellular automatauniversalityupdate rule

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Recommendations

• Computation of functions on n bits by asynchronous clocking of cellular automata
• Computing issues of asynchronous CA
• Asynchronous cellular automata and dynamical properties
• Reversibility of elementary cellular automata under fully asynchronous update
• What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity

Cited in

(4)

• Computation by asynchronously updating cellular automata
• Universal gates with wires in a row
• Computation of functions on n bits by asynchronous clocking of cellular automata
• Realization problems for nonuniform cellular automata

This page was built for publication: Computing by temporal order: asynchronous cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986314)