TY - JOUR

T1 - Computational universality of fungal sandpile automata

AU - Goles, Eric

AU - Tsompanas, Michail Antisthenis

AU - Adamatzky, Andrew

AU - Tegelaar, Martin

AU - Wosten, Han A.B.

AU - Martínez, Genaro J.

N1 - Publisher Copyright:
© 2020 Elsevier B.V.

PY - 2020/8/6

Y1 - 2020/8/6

N2 - Hyphae within the mycelia of the ascomycetous fungi are compartmentalised by septa. Each septum has a pore that allows for inter-compartmental and inter-hyphal streaming of cytosol and even organelles. The compartments, however, have special organelles, Woronin bodies, that can plug the pores. When the pores are blocked, no flow of cytoplasm takes place. Inspired by the controllable compartmentalisation within the mycelium of the ascomycetous fungi we designed two-dimensional fungal automata. A fungal automaton is a cellular automaton where communication between neighbouring cells can be blocked on demand. We demonstrate computational universality of the fungal automata by implementing sandpile cellular automata circuits there. We reduce the Monotone Circuit Value Problem to the Fungal Automaton Prediction Problem. We construct families of wires, cross-overs and gates to prove that the fungal automata are P-complete.

AB - Hyphae within the mycelia of the ascomycetous fungi are compartmentalised by septa. Each septum has a pore that allows for inter-compartmental and inter-hyphal streaming of cytosol and even organelles. The compartments, however, have special organelles, Woronin bodies, that can plug the pores. When the pores are blocked, no flow of cytoplasm takes place. Inspired by the controllable compartmentalisation within the mycelium of the ascomycetous fungi we designed two-dimensional fungal automata. A fungal automaton is a cellular automaton where communication between neighbouring cells can be blocked on demand. We demonstrate computational universality of the fungal automata by implementing sandpile cellular automata circuits there. We reduce the Monotone Circuit Value Problem to the Fungal Automaton Prediction Problem. We construct families of wires, cross-overs and gates to prove that the fungal automata are P-complete.

KW - Computational universality

KW - Fungi

KW - Sandpile automata

UR - http://www.scopus.com/inward/record.url?scp=85084482875&partnerID=8YFLogxK

U2 - 10.1016/j.physleta.2020.126541

DO - 10.1016/j.physleta.2020.126541

M3 - Article

AN - SCOPUS:85084482875

SN - 0375-9601

VL - 384

JO - Physics Letters, Section A: General, Atomic and Solid State Physics

JF - Physics Letters, Section A: General, Atomic and Solid State Physics

IS - 22

M1 - 126541

ER -