The following pages link to Complexity of Langton's ant (Q1348376):
Displayed 17 items.
- How random is spatiotemporal chaos of Langton's ant? (Q275531) (← links)
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) (Q306278) (← links)
- About non-monotony in Boolean automata networks (Q393147) (← links)
- Kadanoff sand pile model. Avalanche structure and wave shape (Q393152) (← links)
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- On time-symmetry in cellular automata (Q439976) (← links)
- Strong emergence of wave patterns on Kadanoff sandpiles (Q528976) (← links)
- The robot cleans up (Q849139) (← links)
- A pseudo-random network mobile automaton with linear growth (Q989450) (← links)
- The robot crawler graph process (Q1671307) (← links)
- Recognizing the repeatable configurations of time-reversible generalized Langton's ant is PSPACE-hard (Q1736474) (← links)
- Dynamics of a class of ants on a one-dimensional lattice (Q1885916) (← links)
- On the emergence of regularities on one-dimensional decreasing sandpiles (Q2003991) (← links)
- Eric Goles (Q2086708) (← links)
- An extended strange planet protocol (Q2355986) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Casse-Briques (Q5739436) (← links)