Construction universality in purely asynchronous cellular automata

DOI10.1016/j.jcss.2006.04.006zbMath1119.68122OpenAlexW1998947216MaRDI QIDQ856418

Ferdinand Peper, Nobuyuki Matsui, Teijiro Isokawa, Yousuke Takada

Publication date: 7 December 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2006.04.006

zbMATH Keywords

asynchronous cellular automataregister machineself-reproductionconstruction universalitydelay-insensitive circuits

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (4)

Asynchronous self-reproducing loops with arbitration capability ⋮ Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton ⋮ Swarm Intelligence ⋮ A spectral outlook on the elementary cellular automata with cyclic configurations and block-sequential asynchronous updates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata and concurrency
• A note on asynchronous cellular automata
• Self-reproduction in a reversible cellular space
• Delay-insensitive computation in asynchronous cellular automata
• Computation by asynchronously updating cellular automata
• Asynchronous game of life
• Simple Systems That Exhibit Self-Directed Replication
• ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
• Towards a Theory of Universal Speed-Independent Modules
• Universal delay-insensitive systems with buffering lines
• Self-Timed Cellular Automata and their computational ability
• Petri net implementations by a universal cell space
• Universality of Hexagonal Asynchronous Totalistic Cellular Automata
• Universal Construction on Self-Timed Cellular Automata
• UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA

This page was built for publication: Construction universality in purely asynchronous cellular automata