Computation by asynchronously updating cellular automata

DOI10.1023/B:JOSS.0000003112.54283.ACMaRDI QIDQ1777751zbMATH OpenFDO

Authors Susumu Adachi, Ferdinand Peper, Jia Lee

Publication date 25 May 2005

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:JOSS.0000003112.54283.AC

zbMATH Keywords

asynchronous cellular automatadelay-insensitive circuitmoduleMoore neighborhoodsignaltotalistic ruleuniversal computation

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Recommendations

• Computational aspects of asynchronous cellular automata
• ON ASYNCHRONOUS CELLULAR AUTOMATA
• Delay-insensitive computation in asynchronous cellular automata
• Computing by temporal order: asynchronous cellular automata
• Computational complexity of finite asynchronous cellular automata
• Asynchronous mappings and asynchronous cellular automata
• Asynchronous cellular automata and dynamical properties
• Synchronization of asynchronous concurrent processes using cellular automata
• Fundamentals of Computation Theory
• Computation of functions on n bits by asynchronous clocking of cellular automata

Cited in

(19)

• Characterization of random fluctuation-based computation in cellular automata
• Delay-insensitive computation in asynchronous cellular automata
• Super-rational aspiration induced strategy updating promotes cooperation in the asymmetric prisoner's dilemma game
• Effect of asynchronous updating on the stability of cellular automata
• First steps on asynchronous lattice-gas models with an application to a swarming rule
• Computation of functions on n bits by asynchronous clocking of cellular automata
• ON ASYNCHRONOUS CELLULAR AUTOMATA
• Computing by Swarm Networks
• Overview: PCA models and issues
• FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA
• scientific article; zbMATH DE number 2113945 (Why is no real title available?)
• Universality of Hexagonal Asynchronous Totalistic Cellular Automata
• UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
• Turing-completeness of asynchronous non-camouflage cellular automata
• Asynchronous communicating cellular automata: formalization, robustness and equivalence
• Emergence of long range order for sublattice update in coupled map lattices
• CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA
• A comprehensive taxonomy of cellular automata
• Construction universality in purely asynchronous cellular automata

This page was built for publication: Computation by asynchronously updating cellular automata

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