4 research outputs found
Computational universality of fungal sandpile automata
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
Exploring the Dynamics of Fungal Cellular Automata
Cells in a fungal hyphae are separated by internal walls (septa). The septa
have tiny pores that allow cytoplasm flowing between cells. Cells can close
their septa blocking the flow if they are injured, preventing fluid loss from
the rest of filament. This action is achieved by special organelles called
Woronin bodies. Using the controllable pores as an inspiration we advance one
and two-dimensional cellular automata into Elementary fungal cellular automata
(EFCA) and Majority fungal automata (MFA) by adding a concept of Woronin bodies
to the cell state transition rules. EFCA is a cellular automaton where the
communications between neighboring cells can be blocked by the activation of
the Woronin bodies (Wb), allowing or blocking the flow of information
(represented by a cytoplasm and chemical elements it carries) between them. We
explore a novel version of the fungal automata where the evolution of the
system is only affected by the activation of the Wb. We explore two case
studies: the Elementary Fungal Cellular Automata (EFCA), which is a direct
application of this variant for elementary cellular automata rules, and the
Majority Fungal Automata (MFA), which correspond to an application of the Wb to
two dimensional automaton with majority rule with Von Neumann neighborhood. By
studying the EFCA model, we analyze how the 256 elementary cellular automata
rules are affected by the activation of Wb in different modes, increasing the
complexity on applied rule in some cases. Also we explore how a consensus over
MFA is affected when the continuous flow of information is interrupted due to
the activation of Woronin bodies.Comment: 31 pages, 30 figure
Computational universality of fungal sandpile automata
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
Computational universality of fungal sandpile automata
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