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)
signalmoduleuniversal computationasynchronous cellular automatadelay-insensitive circuitMoore neighborhoodtotalistic rule
Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items (12)
First steps on asynchronous lattice-gas models with an application to a swarming rule ⋮ Characterization of random fluctuation-based computation in cellular automata ⋮ Construction universality in purely asynchronous cellular automata ⋮ Overview: PCA Models and Issues ⋮ Effect of asynchronous updating on the stability of cellular automata ⋮ Emergence of long range order for sublattice update in coupled map lattices ⋮ CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA ⋮ Computing by Swarm Networks ⋮ Super-rational aspiration induced strategy updating promotes cooperation in the asymmetric prisoner's dilemma game ⋮ FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA ⋮ Delay-insensitive computation in asynchronous cellular automata ⋮ UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
This page was built for publication: Computation by asynchronously updating cellular automata
