Beyond input-output computings: error-driven emergence with parallel non-distributed slime mold computer

Towards a Physarum learning chip

Networks of protoplasmic tubes of organism Physarum polycehpalum are macro-scale structures which optimally span multiple food sources to avoid repellents yet maximize coverage of attractants. When data are presented by configurations of attractants and behaviour of the slime mould is tuned by a range of repellents, the organism preforms computation. It maps given data configuration into a protoplasmic network. To discover physical means of programming the slime mould computers we explore conductivity of the protoplasmic tubes; proposing that the network connectivity of protoplasmic tubes shows pathway-dependent plasticity. To demonstrate this we encourage the slime mould to span a grid of electrodes and apply AC stimuli to the network. Learning and weighted connections within a grid of electrodes is produced using negative and positive voltage stimulation of the network at desired nodes; low frequency (10 Hz) sinusoidal (0.5 V peak-to-peak) voltage increases connectivity between stimulated electrodes while decreasing connectivity elsewhere, high frequency (1000 Hz) sinusoidal (2.5 V peak-to-peak) voltage stimulation decreases network connectivity between stimulated electrodes. We corroborate in a particle model. This phenomenon may be used for computation in the same way that neural networks process information and has the potential to shed light on the dynamics of learning and information processing in non-neural metazoan somatic cell networks.

Amoeba-inspired Tug-of-War algorithms for exploration-exploitation dilemma in extended Bandit Problem

The true slime mold Physarum polycephalum, a single-celled amoeboid organism, is capable of efficiently allocating a constant amount of intracellular resource to its pseudopod-like branches that best fit the environment where dynamic light stimuli are applied. Inspired by the resource allocation process, the authors formulated a concurrent search algorithm, called the Tug-of-War (TOW) model, for maximizing the profit in the multi-armed Bandit Problem (BP). A player (gambler) of the BP should decide as quickly and accurately as possible which slot machine to invest in out of the N machines and faces an "exploration-exploitation dilemma." The dilemma is a trade-off between the speed and accuracy of the decision making that are conflicted objectives. The TOW model maintains a constant intracellular resource volume while collecting environmental information by concurrently expanding and shrinking its branches. The conservation law entails a nonlocal correlation among the branches, i.e., volume increment in one branch is immediately compensated by volume decrement(s) in the other branch(es). Owing to this nonlocal correlation, the TOW model can efficiently manage the dilemma. In this study, we extend the TOW model to apply it to a stretched variant of BP, the Extended Bandit Problem (EBP), which is a problem of selecting the best M-tuple of the N machines. We demonstrate that the extended TOW model exhibits better performances for 2-tuple-3-machine and 2-tuple-4-machine instances of EBP compared with the extended versions of well-known algorithms for BP, the ϵ-Greedy and SoftMax algorithms, particularly in terms of its short-term decision-making capability that is essential for the survival of the amoeba in a hostile environment.

Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics

Biologically inspired computing devices and architectures are expected to overcome the limitations of conventional technologies in terms of solving computationally demanding problems, adapting to complex environments, reducing energy consumption, and so on. We previously demonstrated that a primitive single-celled amoeba (a plasmodial slime mold), which exhibits complex spatiotemporal oscillatory dynamics and sophisticated computing capabilities, can be used to search for a solution to a very hard combinatorial optimization problem. We successfully extracted the essential spatiotemporal dynamics by which the amoeba solves the problem. This amoeba-inspired computing paradigm can be implemented by various physical systems that exhibit suitable spatiotemporal dynamics resembling the amoeba's problem-solving process. In this Article, we demonstrate that photoexcitation transfer phenomena in certain quantum nanostructures mediated by optical near-field interactions generate the amoebalike spatiotemporal dynamics and can be used to solve the satisfiability problem (SAT), which is the problem of judging whether a given logical proposition (a Boolean formula) is self-consistent. SAT is related to diverse application problems in artificial intelligence, information security, and bioinformatics and is a crucially important nondeterministic polynomial time (NP)-complete problem, which is believed to become intractable for conventional digital computers when the problem size increases. We show that our amoeba-inspired computing paradigm dramatically outperforms a conventional stochastic search method. These results indicate the potential for developing highly versatile nanoarchitectonic computers that realize powerful solution searching with low energy consumption.

Amoeba-based computing for traveling salesman problem: long-term correlations between spatially separated individual cells of Physarum polycephalum

A single-celled, multi-nucleated amoeboid organism, a plasmodium of the true slime mold Physarum polycephalum, can perform sophisticated computing by exhibiting complex spatiotemporal oscillatory dynamics while deforming its amorphous body. We previously devised an "amoeba-based computer (ABC)" to quantitatively evaluate the optimization capability of the amoeboid organism in searching for a solution to the traveling salesman problem (TSP) under optical feedback control. In ABC, the organism changes its shape to find a high quality solution (a relatively shorter TSP route) by alternately expanding and contracting its pseudopod-like branches that exhibit local photoavoidance behavior. The quality of the solution serves as a measure of the optimality of which the organism maximizes its global body area (nutrient absorption) while minimizing the risk of being illuminated (exposure to aversive stimuli). ABC found a high quality solution for the 8-city TSP with a high probability. However, it remains unclear whether intracellular communication among the branches of the organism is essential for computing. In this study, we conducted a series of control experiments using two individual cells (two single-celled organisms) to perform parallel searches in the absence of intercellular communication. We found that ABC drastically lost its ability to find a solution when it used two independent individuals. However, interestingly, when two individuals were prepared by dividing one individual, they found a solution for a few tens of minutes. That is, the two divided individuals remained correlated even though they were spatially separated. These results suggest the presence of a long-term memory in the intrinsic dynamics of this organism and its significance in performing sophisticated computing.

Spontaneous deadlock breaking on amoeba-based neurocomputer

Any artificial concurrent computing system involves a potential risk of "deadlock" that its multiple processes sharing common computational resources are stuck in starved conditions, if simultaneous accesses of the processes to the resources were unconditionally permitted. To avoid the deadlock, it is necessary to set up some form of central control protocol capable of appropriately regulating the resource allocation. On the other hand, many decentralized biological systems also perform concurrent computing based on interactions of components sharing limited amounts of available resources. Despite the absence of a central control unit, they appear to be free from the deadlock implying their death, as long as they are alive. Should we consider that biological computing paradigms are essentially different from artificial ones? Here we employ a photosensitive amoeboid cell known as a model organism for studying cellular information processing and construct an experimental system to explore how the amoeba copes with deadlock-like situations induced by optical feedback control. The feedback control is implemented by a recurrent neural network algorithm for leading the amoeba to solve a particular constraint satisfaction problem. We show that the amoeba is capable of breaking through the deadlock-like situations because its oscillating cellular membrane spontaneously produces a wide variety of spatiotemporal patterns. The result implies that our system can be developed to a neurocomputer that works as logical circuit, associative memory device, combinatorial optimization problem solver, and chaotic computer capable of spontaneous transition among multiple solutions.