Simple Computation-Universal Cellular Spaces
From MaRDI portal
Cited in
(47)- Computation theory of cellular automata
- Discrete event models for cell space simulation
- The attractor-basin portrait of a cellular automaton
- On 'forgetful' cellular automata
- A note on asynchronous cellular automata
- On topological dynamics of Turing machines
- Inducing an order on cellular automata by a grouping operation
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Graph-theoretical characterization of invertible cellular automata
- Analog computation with dynamical systems
- An information-based classification of elementary cellular automata
- An automaton group with undecidable order and Engel problems
- The ontology of digital physics
- Two-dimensional cellular automata and their neighborhoods
- On Boolean automata isolated cycles and tangential double-cycles dynamics
- Complexity-theoretic aspects of expanding cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Non-deterministic cellular automata and languages
- Some properties of topological pressure on cellular automata
- Statistical mechanics of cellular automata
- Some applications of propositional logic to cellular automata
- On the computational power of totalistic cellular automata
- Complete symmetry in d2l systems and cellular automata
- On Goles' universal machines: a computational point of view
- On time reduction and simulation in cellular spaces
- A representational approach to reduction in dynamical systems
- Cellular automata universality revisited
- Efficient unidimensional universal cellular automaton
- Decision problems for cellular automata and their semigroups
- A comparison of finite and cellular automata
- Logical gates via gliders collisions
- Shift-symmetric configurations in two-dimensional cellular automata: irreversibility, insolvability, and enumeration
- Bulking II: Classifications of cellular automata
- Universal asynchronous iterative arrays of Mealy automata
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Four states are enough!
- Complexity-theoretic aspects of expanding cellular automata
- Highly symmetric cellular automata and their symmetry-breaking patterns
- Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
- Lattice games without rational strategies
- Combinatorial designs and cellular automata: a survey
- Developmental construction of face-centered cubic cellular automata inspired by excitable media
- The constructibility of a configuration in a cellular automaton
- Computation theoretic aspects of cellular automata
- The topological pressure of linear cellular automata
- Computational complexity of dynamical systems: the case of cellular automata
This page was built for publication: Simple Computation-Universal Cellular Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5626540)
