The following pages link to (Q5321501):
Displaying 50 items.
- Turing patterns with Turing machines: emergence and low-level structure formation (Q256719) (← links)
- Playing with complexity: from cellular evolutionary algorithms with coalitions to self-organizing maps (Q305505) (← links)
- Symbolic dynamics of glider guns for some one-dimensional cellular automata (Q345918) (← links)
- Stability of cellular automata trajectories revisited: branching walks and Lyapunov profiles (Q347077) (← links)
- Impartial games emulating one-dimensional cellular automata and undecidability (Q385042) (← links)
- Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation (Q418663) (← links)
- Around probabilistic cellular automata (Q475395) (← links)
- Three small universal spiking neural P systems (Q487986) (← links)
- New aspects of symmetry of elementary cellular automata (Q502930) (← links)
- Nondeterministic cellular automata (Q508657) (← links)
- Topological chaos of universal elementary cellular automata rule (Q547228) (← links)
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata (Q549699) (← links)
- Four states are enough! (Q616491) (← links)
- A universal cellular automaton on the heptagrid of the hyperbolic plane with four states (Q616492) (← links)
- Abstract geometrical computation. IV: Small Turing universal signal machines (Q616493) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- Computational processes, observers and Turing incompleteness (Q616506) (← links)
- Invertible behavior in elementary cellular automata with memory (Q712682) (← links)
- Dynamics of universal computation and \(1/f\) noise in elementary cellular automata (Q728155) (← links)
- Phenomenology of glider collisions in cellular automaton Rule 54 and associated logical gates (Q813590) (← links)
- Logical gates on gliders in restricted space domain cellular automata (Q831683) (← links)
- Defect particle kinematics in one-dimensional cellular automata (Q884475) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- Computational complexity of dynamical systems: the case of cellular automata (Q948080) (← links)
- Elementary cellular automaton Rule 110 explained as a block substitution system. Rule 110 as a block substitution system (Q985741) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Semi-Galois categories. II: An arithmetic analogue of Christol's theorem (Q1643559) (← links)
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality (Q1672012) (← links)
- An information-based classification of elementary cellular automata (Q1674805) (← links)
- Computational modelling of the kinetic tile assembly model using a rule-based approach (Q1682869) (← links)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates (Q1755339) (← links)
- Dynamical criticality: overview and open questions (Q1794296) (← links)
- Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata (Q1935774) (← links)
- A one-dimensional physically universal cellular automaton (Q2011676) (← links)
- LUNAR: cellular automata for drifting data streams (Q2053913) (← links)
- The mirage of universality in cellular automata (Q2086715) (← links)
- On Boolean automata isolated cycles and tangential double-cycles dynamics (Q2086725) (← links)
- On fungal automata (Q2086749) (← links)
- Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures (Q2152436) (← links)
- New approach to evaluate the asymptotic distribution of particle systems expressed by probabilistic cellular automata (Q2174796) (← links)
- Semipredictable dynamical systems (Q2200210) (← links)
- Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules (Q2207952) (← links)
- Making sense of sensory input (Q2238610) (← links)
- Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates (Q2247031) (← links)
- Emulating cellular automata in chemical reaction-diffusion networks (Q2311218) (← links)
- A novel construction of chaotic dynamics base gliders in diffusion rule B2/S7 (Q2353756) (← links)
- Percolation and disorder-resistance in cellular automata (Q2354150) (← links)
