Intrinsically universal cellular automata
From MaRDI portal
Recommendations
Cited in
(19)- Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata
- Computational universality of fungal sandpile automata
- The two-handed tile assembly model is not intrinsically universal
- An intrinsically universal family of causal graph dynamics
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
- scientific article; zbMATH DE number 1962850 (Why is no real title available?)
- scientific article; zbMATH DE number 2013806 (Why is no real title available?)
- scientific article; zbMATH DE number 2063251 (Why is no real title available?)
- scientific article; zbMATH DE number 2086632 (Why is no real title available?)
- scientific article; zbMATH DE number 1839463 (Why is no real title available?)
- Intrinsic simulations between stochastic cellular automata
- Efficient unidimensional universal cellular automaton
- A particular universal cellular automaton
- STACS 2005
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality
- Communication complexity and intrinsic universality in cellular automata
- scientific article; zbMATH DE number 7724182 (Why is no real title available?)
- On hardest languages for one-dimensional cellular automata
- Structure and computability of preimages in the Game of Life
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)
