The following pages link to Four states are enough! (Q616491):
Displayed 12 items.
- The two-handed tile assembly model is not intrinsically universal (Q262271) (← links)
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata (Q549699) (← links)
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality (Q1672012) (← links)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- On the complexity of two-dimensional signed majority cellular automata (Q2409572) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Non-isometric Contextual Array Grammars with Regular Control and Local Selectors (Q2945879) (← links)
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems (Q2945884) (← links)
- Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata (Q3186474) (← 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)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)