Self-Timed Cellular Automata and their computational ability

DOI10.1016/S0167-739X(02)00069-9zbMath1042.68080OpenAlexW2019576097MaRDI QIDQ4788329

Noriaki Kouda, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui

Publication date: 21 January 2003

Published in: Future Generation Computer Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-739x(02)00069-9

zbMATH Keywords

Asynchronous Cellular AutomataUniversal computationChain reactionsSelf-timing

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (11)

Asynchronous game of life ⋮ Construction universality in purely asynchronous cellular automata ⋮ Asynchronous self-reproducing loops with arbitration capability ⋮ Defect-tolerance in cellular nanocomputers ⋮ An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements ⋮ Emergence of universal global behavior from reversible local transitions in asynchronous systems ⋮ FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA ⋮ UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA ⋮ A defect localization scheme for cellular nanocomputers ⋮ Self-replicating loops: a survey ⋮ Probing robustness of cellular automata through variations of asynchronous updating

This page was built for publication: Self-Timed Cellular Automata and their computational ability