Intrinsically universal cellular automata

zbMATH Open1455.68113arXiv0906.3213MaRDI QIDQ5145161FDOQ5145161

Authors: Nicolas Ollinger 

Publication date: 20 January 2021

Full work available at URL: https://arxiv.org/abs/0906.3213

Recommendations

• scientific article; zbMATH DE number 2086632
• Efficient unidimensional universal cellular automaton
• scientific article; zbMATH DE number 1962850
• Communication complexity and intrinsic universality in cellular automata
• STACS 2005

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cited In (18)

• The two-handed tile assembly model is not intrinsically universal
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An intrinsically universal family of causal graph dynamics
• Communication complexity and intrinsic universality in cellular automata
• STACS 2005
• Communication complexity meets cellular automata: necessary conditions for intrinsic universality
• Title not available (Why is that?)
• Efficient unidimensional universal cellular automaton
• The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
• Title not available (Why is that?)
• Intrinsic simulations between stochastic cellular automata
• Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata
• On hardest languages for one-dimensional cellular automata
• A particular universal cellular automaton
• Title not available (Why is that?)
• Computational universality of fungal sandpile automata

This page was built for publication: Intrinsically universal cellular automata

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