Exploring the Dynamics of Fungal Cellular Automata (2210.14615v1)
Abstract: 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.
- The fungi. Academic Press, 2015.
- Ramesh Maheshwari. Fungi: Experimental Methods In Biology. CRC Press, 2016.
- Andrew Adamatzky. Towards fungal computer. Interface focus, 8(6):20180029, 2018.
- On boolean gates in fungal colony. Biosystems, 193:104138, 2020a.
- Mem-fractive properties of mushrooms. Bioinspiration & Biomimetics, 2021.
- Computational universality of fungal sandpile automata. Physics Letters A, 384(22):126541, 2020.
- Generating boolean functions on totalistic automata networks. International Journal of Unconventional Computing, 16(4), 2021.
- Fungal automata. Complex Systems, 29(4), 2020b.
- Stephen Wolfram. Cellular automata as models of complexity. Nature, 311(5985):419–424, 1984.
- Stephen Wolfram. Cellular automata and complexity: collected papers. CRC Press, 2018.
- Stephen Wolfram. Statistical mechanics of cellular automata. Reviews of modern physics, 55(3):601, 1983.
- Cristopher Moore. Computational complexity in physics. In Complexity from Microscopic to Macroscopic Scales: Coherence and Large Deviations, pages 131–135. Springer, 2002.
- Cristopher Moore. Majority-vote cellular automata, ising dynamics, and p-completeness. Journal of Statistical Physics, 88(3):795–805, 1997.
- Life without death is p-complete. Complex Systems, 10:437–447, 1996.
- P-completeness of cellular automaton rule 110. In International Colloquium on Automata, Languages, and Programming, pages 132–143. Springer, 2006.
- Genaro J Martínez. A note on elementary cellular automata classification. Journal of Cellular Automata, 8, 2013.