Delay-insensitive computation in asynchronous cellular automata

DOI10.1016/J.JCSS.2004.10.009zbMath1101.68689OpenAlexW2007057182MaRDI QIDQ1776377

Shinro Mashiko, Ferdinand Peper, Jia Lee, Susumu Adachi

Publication date: 12 May 2005

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.2004.10.009

zbMATH Keywords

universal Turing machine

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (9)

\(m\)-asynchronous cellular automata: from fairness to quasi-fairness ⋮ Characterization of random fluctuation-based computation in cellular automata ⋮ Construction universality in purely asynchronous cellular automata ⋮ Asynchronous communicating cellular automata: formalization, robustness and equivalence ⋮ Fluctuation-driven computing on number-conserving cellular automata ⋮ Aligning the representation and reality of computation with asynchronous logic automata ⋮ Computing by Swarm Networks ⋮ Efficient Circuit Construction in Brownian Cellular Automata Based on a New Building-Block for Delay-Insensitive Circuits ⋮ Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronous to asynchronous transformation of polyautomata
• A note on asynchronous cellular automata
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• Computation by asynchronously updating cellular automata
• Asynchronous game of life
• Towards a Theory of Universal Speed-Independent Modules
• Petri net implementations by a universal cell space

This page was built for publication: Delay-insensitive computation in asynchronous cellular automata