Pages that link to "Item:Q5626540"
From MaRDI portal
The following pages link to Simple Computation-Universal Cellular Spaces (Q5626540):
Displaying 45 items.
- Some properties of topological pressure on cellular automata (Q307895) (← links)
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- A representational approach to reduction in dynamical systems (Q488476) (← links)
- Bulking II: Classifications of cellular automata (Q549701) (← links)
- Universal asynchronous iterative arrays of Mealy automata (Q599501) (← links)
- Four states are enough! (Q616491) (← links)
- Lattice games without rational strategies (Q654900) (← links)
- The constructibility of a configuration in a cellular automaton (Q758953) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- The topological pressure of linear cellular automata (Q845410) (← links)
- Computational complexity of dynamical systems: the case of cellular automata (Q948080) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- Discrete event models for cell space simulation (Q1164423) (← links)
- The attractor-basin portrait of a cellular automaton (Q1203278) (← links)
- On 'forgetful' cellular automata (Q1227707) (← links)
- A note on asynchronous cellular automata (Q1253544) (← links)
- On topological dynamics of Turing machines (Q1269915) (← links)
- Inducing an order on cellular automata by a grouping operation (Q1283794) (← links)
- A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
- Graph-theoretical characterization of invertible cellular automata (Q1581757) (← links)
- Analog computation with dynamical systems (Q1586961) (← links)
- An information-based classification of elementary cellular automata (Q1674805) (← links)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- The ontology of digital physics (Q1707215) (← links)
- Two-dimensional cellular automata and their neighborhoods (Q1884945) (← links)
- On Boolean automata isolated cycles and tangential double-cycles dynamics (Q2086725) (← links)
- Complexity-theoretic aspects of expanding cellular automata (Q2278565) (← links)
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures (Q2561573) (← links)
- Non-deterministic cellular automata and languages (Q2869781) (← links)
- Statistical mechanics of cellular automata (Q3646415) (← links)
- Some applications of propositional logic to cellular automata (Q3650319) (← links)
- On the computational power of totalistic cellular automata (Q3763596) (← links)
- Complete symmetry in d2l systems and cellular automata (Q3802630) (← links)
- On time reduction and simulation in cellular spaces (Q4261194) (← links)
- Cellular automata universality revisited (Q5055946) (← links)
- Efficient unidimensional universal cellular automaton (Q5096850) (← links)
- Decision problems for cellular automata and their semigroups (Q5096855) (← links)
- A comparison of finite and cellular automata (Q5096907) (← links)
- Logical Gates via Gliders Collisions (Q5112170) (← links)
- Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration (Q5227589) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
- A survey of cellular automata: types, dynamics, non-uniformity and applications (Q6151179) (← links)
- Complexity-theoretic aspects of expanding cellular automata (Q6195134) (← links)
- Highly symmetric cellular automata and their symmetry-breaking patterns (Q6205959) (← links)
- Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata (Q6547963) (← links)
