The following pages link to SAND PILE AS A UNIVERSAL COMPUTER (Q4488258):
Displaying 11 items.
- Computing with planar toppling domino arrangements (Q256439) (← links)
- On logical gates in precipitating medium: cellular automaton model (Q717051) (← links)
- Crossing information in two-dimensional sandpiles (Q861291) (← links)
- Eric Goles (Q2086708) (← links)
- On fungal automata (Q2086749) (← links)
- Computational universality of fungal sandpile automata (Q2213185) (← links)
- Number-conserving reversible cellular automata and their computation-universality (Q2773021) (← links)
- CHOOSEY HOT SAND: REFLECTION OF GRAIN SENSITIVITY ON PATTERN MORPHOLOGY (Q4488233) (← links)
- Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three (Q4555049) (← links)
- A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton (Q4571178) (← links)
- Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles (Q5501609) (← links)