2 papers
cs.CC2026
Complexity of Fungal Automaton Prediction
Enrico Formenti, Eric Goles, Kévin Perrot +2
Fungal automata are a nature-inspired computational model, where a rule is alternatively applied verticaly and horizontaly. In this work we study the computational complexity of pr…
cs.CC2026
Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
Eric Goles, Augusto Modanese, MartÃn RÃos-Wilson +2
The sandpile automata of Bak, Tang, and Wiesenfeld (Phys. Rev. Lett., 1987) are a simple model for the diffusion of particles in space. A fundamental problem related to the complex…