|   | 
Details
   web
Records
Author (up) Adamatzky, A.; Goles, E.; Martinez, GJ.; Tsompanas, MA.; Tegelaar, M.; Wosten, HAB.
Title Fungal Automata Type
Year 2020 Publication Complex Systems Abbreviated Journal Complex Syst.
Volume 29 Issue 4 Pages 759-778
Keywords fungi; ascomycete; Woronin body; cellular automata
Abstract 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.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0891-2513 ISBN Medium
Area Expedition Conference
Notes WOS:000604844500002 Approved
Call Number UAI @ alexi.delcanto @ Serial 1319
Permanent link to this record
 

 
Author (up) Goles, E.; Adamatzky, A.; Montealegre, P.; Rios-Wilson, M.
Title Generating Boolean Functions on Totalistic Automata Networks Type
Year 2021 Publication International Journal of Unconventional Computing Abbreviated Journal Int. J. Unconv. Comput.
Volume 16 Issue 4 Pages 343-391
Keywords UNIVERSALITY; PROPAGATION; COMPLEXITY
Abstract We consider the problem of studying the simulation capabilities of the dynamics of arbitrary networks of finite states machines. In these models, each node of the network takes two states 0 (passive) and 1 (active). The states of the nodes are updated in parallel following a local totalistic rule, i.e., depending only on the sum of active states. Four families of totalistic rules are considered: linear or matrix defined rules (a node takes state 1 if each of its neighbours is in state 1), threshold rules (a node takes state 1 if the sum of its neighbours exceed a threshold), isolated rules (a node takes state 1 if the sum of its neighbours equals to some single number) and interval rule (a node takes state 1 if the sum of its neighbours belong to some discrete interval). We focus in studying the simulation capabilities of the dynamics of each of the latter classes. In particular, we show that totalistic automata networks governed by matrix defined rules can only implement constant functions and other matrix defined functions. In addition, we show that t by threshold rules can generate any monotone Boolean functions. Finally, we show that networks driven by isolated and the interval rules exhibit a very rich spectrum of boolean functions as they can, in fact, implement any arbitrary Boolean functions. We complement this results by studying experimentally the set of different Boolean functions generated by totalistic rules on random graphs.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1548-7199 ISBN Medium
Area Expedition Conference
Notes WOS:000654165700002 Approved
Call Number UAI @ alexi.delcanto @ Serial 1393
Permanent link to this record
 

 
Author (up) Goles, E.; Tsompanas, M.A.; Adamatzky, A.; Tegelaar, M.; Wosten, H.A.B.; Martinez, G.J.
Title Computational universality of fungal sandpile automata Type
Year 2020 Publication Physics Letters A Abbreviated Journal Phys. Lett. A
Volume 384 Issue 22 Pages 8 pp
Keywords Fungi; Sandpile automata; Computational universality
Abstract 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. (C) 2020 Elsevier B.V. All rights reserved.
Address [Goles, Eric; Tsompanas, Michail-Antisthenis; Adamatzky, Andrew; Martinez, Genaro J.] Univ West England, Unconvent Comp Lab, Bristol, Avon, England, Email: andrew.adamatzky@uwe.ac.uk
Corporate Author Thesis
Publisher Elsevier Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0375-9601 ISBN Medium
Area Expedition Conference
Notes WOS:000537033500017 Approved
Call Number UAI @ eduardo.moreno @ Serial 1194
Permanent link to this record