Computational universality of fungal sandpile automata

DOI10.1016/j.physleta.2020.126541zbMath1448.68238arXiv2003.08681OpenAlexW3011261497MaRDI QIDQ2213185

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

Publication date: 30 November 2020

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.08681

zbMATH Keywords

fungicomputational universalitysandpile automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Microbiology (92C70)

Related Items

Embedding arbitrary Boolean circuits into fungal automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• SAND PILE AS A UNIVERSAL COMPUTER
• Self-organized critical state of sandpile automaton models
• Fungal Automata

This page was built for publication: Computational universality of fungal sandpile automata