On Boolean gates in fungal colony

Adamatzky, Andrew; Tegelaar, Martin; Wösten, Han A. B.; Powell, Anna L.; Beasley, Alexander E.; Mayne, Richard

doi:10.48550/arxiv.2002.09680

“…A significance of the results presented for future implementations of fungal automata with living fungal colonies in experimental laboratory conditions is the following: in our previous research, see details in [4], we used FitzHugh-Nagumo model to imitate propagation of excitation on the mycelium network of a single colony of Aspergillus niger. Boolean values are encoded by spikes of extracellular potential.…”

Section: Discussionmentioning

confidence: 99%

“…We represented binary inputs by electrical impulses on a pair of selected electrodes and we record responses of the colony from sixteen electrodes. We derived sets of two-inputs-on-output logical gates implementable the fungal colony and analyse distributions of the gates [4]. Indeed, there were combination of functionally complete sets of gates, thus computing with travelling spikes is universal.…”

Section: Discussionmentioning

confidence: 99%

“…On studying electrical responses of fungi to stimulation [1] we proposed design and experimental implementation of fungal computers [2]. Further numerical experiments demonstrated that it is possible to compute Boolean functions with spikes of electrical activity propagating on mycelium networks [4]. At this early stage of developing a fungal computer architecture we need to establish a strong formal background reflecting several alternative ways of computing with fungi.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Computational Universality of Fungal Sandpile Automata

Goles,

Tsompanas,

Adamatzky

et al. 2023

Emergence, Complexity and Computation

0

View full text Add to dashboard Cite

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.

show abstract

“…The underground mycelium network can be seen as a distributed communication and information processing system linking together trees, fungi and bacteria [10]. Mechanisms and dynamics of information processing in mycelium networks form an unexplored field with just a handful of papers published related to space exploration by mycelium [20,19], patterns of electrical activity of fungi [37,34,1] and potential use of fungi as living electronic and computing devices [2,3,4].…”

Section: Introductionmentioning

confidence: 99%

Fungal Automata

Adamatzky¹,

Goles²,

Mart́ınez³

et al. 2020

Self Cite

View full text Add to dashboard Cite

We study a cellular automaton (CA) model of information dynamics on a single hypha of a fungal mycelium. Such a filament is divided in compartments (here also called cells) by septa. These septa are invaginations of the cell wall and their pores allow for the flow of cytoplasm between compartments and hyphae. The septal pores of the fungal phylum of the Ascomycota can be closed by organelles called Woronin bodies. Septal closure is increased when the septa become older and when exposed to stress conditions. Thus, Woronin bodies act as informational flow valves. The one-dimensional fungal automaton is a binary-state ternary neighborhood CA, where every compartment follows one of the elementary cellular automaton (ECA) rules if its pores are open and either remains in state 0 (first species of fungal automata) or its previous state (second species of fungal automata) if its pores are closed. The Woronin bodies closing the pores are also governed by ECA rules. We analyze a structure of the composition space of cell-state transition and pore-state transition rules and the complexity of fungal automata with just a few Woronin bodies, and exemplify several important local events in the automaton dynamics.

show abstract

“…On studying electrical responses of fungi to stimulation [1] we proposed design and experimental implementation of fungal computers [2]. Further numerical experiments demonstrated that it is possible to compute Boolean functions with spikes of electrical activity propagating on mycelium networks [4]. At this early stage of developing a fungal computer architecture we need to establish a strong formal background reflecting several alternative ways of computing with fungi.…”

Section: Introductionmentioning

confidence: 99%

Computational universality of fungal sandpile automata

Goles,

Tsompanas,

Adamatzky

et al. 2020

Preprint

Self Cite

0

View full text Add to dashboard Cite

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.

show abstract

On Boolean gates in fungal colony

Cited by 3 publications

References 0 publications

Computational Universality of Fungal Sandpile Automata

Computational Universality of Fungal Sandpile Automata

Fungal Automata

Computational universality of fungal sandpile automata

Contact Info

Product

Resources

About