Computation by asynchronously updating cellular automata
From MaRDI portal
Publication:1777751
DOI10.1023/B:JOSS.0000003112.54283.aczbMath1060.68075MaRDI QIDQ1777751
Ferdinand Peper, Susumu Adachi, Jia Lee
Publication date: 25 May 2005
Published in: Journal of Statistical Physics (Search for Journal in Brave)
signal; module; universal computation; asynchronous cellular automata; delay-insensitive circuit; Moore neighborhood; totalistic rule
82C20: Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics
68Q80: Cellular automata (computational aspects)
37B15: Dynamical aspects of cellular automata
Related Items
Overview: PCA Models and Issues, FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA, UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA, Emergence of long range order for sublattice update in coupled map lattices, CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA, First steps on asynchronous lattice-gas models with an application to a swarming rule, Construction universality in purely asynchronous cellular automata, 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, Computing by Swarm Networks
