On fungal automata

DOI10.1007/978-3-030-92551-2_25OpenAlexW4226147821MaRDI QIDQ2086749

Genaro J. Martínez, Han A. B. Wosten, Michail-Antisthenis Tsompanas, Martin Tegelaar, Eric Goles Chacc, Andrew Adamatzky

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92551-2_25

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On Goles' universal machines: a computational point of view
• Crossing information in two-dimensional sandpiles
• Parallel chip firing games on graphs
• The computational complexity of sandpiles
• Universality of the chip-firing game
• A computation-universal two-dimensional 8-state triangular reversible cellular automaton
• Reversible space-time simulation of cellular automata
• P-completeness of Cellular Automaton Rule 110
• A universal algorithm for sequential data compression
• SAND PILE AS A UNIVERSAL COMPUTER
• Self-organized critical state of sandpile automaton models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On fungal automata