Towards intrinsically universal asynchronous CA

DOI10.1007/s11047-013-9388-3zbMath1333.68194OpenAlexW2008177074MaRDI QIDQ269777

Thomas Worsch

Publication date: 6 April 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-013-9388-3

zbMATH Keywords

cellular automatauniversalityasynchrony

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

Building squares with optimal state complexity in restricted active self-assembly ⋮ Supercritical probabilistic cellular automata: how effective is the synchronous updating?

Cites Work

• Unnamed Item
• Unnamed Item
• Probing robustness of cellular automata through variations of asynchronous updating
• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• Bulking II: Classifications of cellular automata
• Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• Reversible space-time simulation of cellular automata
• Asynchronous game of life
• Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems
• What Do We Mean by Asynchronous CA? A Reflection on Types and Effects of Asynchronicity

This page was built for publication: Towards intrinsically universal asynchronous CA