Construction universality in purely asynchronous cellular automata

DOI10.1016/J.JCSS.2006.04.006MaRDI QIDQ856418zbMATH OpenOpenAlexFDO

Authors Yousuke Takada, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui

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)

Recommendations

• Universal Construction on Self-Timed Cellular Automata
• Towards intrinsically universal asynchronous CA
• UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
• Computing issues of asynchronous CA
• Self-Timed Cellular Automata and their computational ability

Cites work

• scientific article; zbMATH DE number 3898244 (Why is no real title available?)
• scientific article; zbMATH DE number 3606384 (Why is no real title available?)
• scientific article; zbMATH DE number 1738656 (Why is no real title available?)
• scientific article; zbMATH DE number 2113945 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3338162 (Why is no real title available?)
• A note on asynchronous cellular automata
• Asynchronous game of life
• Automata and concurrency
• Computation by asynchronously updating cellular automata
• Delay-insensitive computation in asynchronous cellular automata
• ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
• Petri net implementations by a universal cell space
• Self-Timed Cellular Automata and their computational ability
• Self-reproduction in a reversible cellular space
• Simple systems that exhibit self-directed replication
• Towards a Theory of Universal Speed-Independent Modules
• UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
• Universal Construction on Self-Timed Cellular Automata
• Universal delay-insensitive systems with buffering lines
• Universality of Hexagonal Asynchronous Totalistic Cellular Automata

Cited in

(10)

• Towards intrinsically universal asynchronous CA
• UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
• Universality of Hexagonal Asynchronous Totalistic Cellular Automata
• Universal Construction on Self-Timed Cellular Automata
• Asynchronous self-reproducing loops with arbitration capability
• Swarm Intelligence
• Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton
• A universal Brownian cellular automaton with 3 states and 2 rules
• A spectral outlook on the elementary cellular automata with cyclic configurations and block-sequential asynchronous updates
• Self-Timed Cellular Automata and their computational ability

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

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