Evolving spiking networks with variable memristors
(2011)
Presentation / Conference Contribution
Andrew Adamatzky's Outputs (303)
Sounds synthesis with slime mould of Physarum Polycephalum (2011)
Journal Article
This paper introduces a novel application of bionic engineering: a bionic musical instrument using Physarum polycephalum. Physarum polycephalum is a huge single cell with thousands of nuclei, which behaves like a giant amoeba. During its foraging beh... Read More about Sounds synthesis with slime mould of Physarum Polycephalum.
On electrical correlates of physarum polycephalum spatial activity: Can we see physarum machine in the dark? (2011)
Journal Article
Plasmodium of Physarum polycephalum is a single cell visible by unaided eye, which spans sources of nutrients with its protoplasmic network. In a very simple experimental setup we recorded electric potential of the propagating plasmodium. We discover... Read More about On electrical correlates of physarum polycephalum spatial activity: Can we see physarum machine in the dark?.
On attraction of slime mould Physarum polycephalum to plants with sedative properties (2011)
Journal Article
A plasmodium of acellular slime mould Physarum polycephalum is a large single cell with many nuclei. Presented to a configuration of attracting and repelling stimuli a plasmodium optimizes its growth pattern and spans the attractants, while avoiding... Read More about On attraction of slime mould Physarum polycephalum to plants with sedative properties.
Computer scientists build cellular automaton supercollider (2011)
Journal Article
A virtual accelerator that smashes together glider-like particles inside a cellular automaton can perform computations, say researchers.
Towards evolving spiking networks with memristive synapses (2011)
Presentation / Conference Contribution
This paper presents a spiking neuro-evolutionary system which implements memristors as neuromodulatory connections, ie whose weights can vary during a trial. The evolutionary design process exploits parameter self-adaptation and a constructionist app... Read More about Towards evolving spiking networks with memristive synapses.
Cellular automaton supercolliders (2011)
Journal Article
Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular automaton analogous of localizations or quasi-loca... Read More about Cellular automaton supercolliders.
Towards constructing one-bit binary adder in excitable chemical medium (2011)
Journal Article
The light-sensitive modification (ruthenium catalysed) of the Belousov-Zhabotinsky reaction exhibits various excitability regimes depending on the level of illumination. Within a narrow range of applied illumination levels the medium is in a sub-exci... Read More about Towards constructing one-bit binary adder in excitable chemical medium.
Computational modalities of Belousov-Zhabotinsky encapsulated vesicles (2011)
Journal Article
We present both simulated and partial empirical evidences for the computational utility of many connected vesicle analogues of an encapsulated nonlinear chemical processing medium. By connecting small vesicles containing a solution of sub-excitable B... Read More about Computational modalities of Belousov-Zhabotinsky encapsulated vesicles.
Towards arithmetic circuits in sub-excitable chemical media (2011)
Journal Article
A sub-excitable Belousov-Zhabotinsky medium exhibits localized travelling excitations (in contrast to an excitable medium exhibiting target or spiral waves). Initially assymetric perturbations give birth to excitation wave-fragments. The shape and ve... Read More about Towards arithmetic circuits in sub-excitable chemical media.
Memristive excitable cellular automata (2011)
Journal Article
The memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device's terminals. We design a minimalistic model of a regular network of memristors using structurally-dynamic cellular automata.... Read More about Memristive excitable cellular automata.
On the internalisation, intraplasmodial carriage and excretion of metallic nanoparticles in the slime mould, Physarum polycephalum (2011)
Journal Article
The plasmodium of Physarum polycephalum is a large single cell visible with the naked eye. When inoculated on a substrate with attractants and repellents the plasmodium develops optimal networks of protoplasmic tubes which span sites of attractants (... Read More about On the internalisation, intraplasmodial carriage and excretion of metallic nanoparticles in the slime mould, Physarum polycephalum.
On polymorphic logical gates in subexcitable chemical medium (2011)
Journal Article
In a subexcitable light-sensitive Belousov-Zhabotinsky (BZ) chemical medium an asymmetric disturbance causes the formation of localized traveling wave-fragments. Under the right conditions these wave-fragments can conserve their shape and velocity ve... Read More about On polymorphic logical gates in subexcitable chemical medium.
Stochastic automated search methods in cellular automata: The discovery of tens of thousands of glider guns (2010)
Journal Article
This paper deals with the spontaneous emergence of glider guns in cellular automata. An evolutionary search for glider guns with different parameters is described and other search techniques are also presented to provide a benchmark. We demonstrate t... Read More about Stochastic automated search methods in cellular automata: The discovery of tens of thousands of glider guns.
Physarum machines: Computers from slime mould (2010)
Book
A Physarum machine is a programmable amorphous biological computer experimentally implemented in the vegetative state of true slime mould Physarum polycephalum. It comprises an amorphous yellowish mass with networks of protoplasmic veins, programmed... Read More about Physarum machines: Computers from slime mould.
Computation with competing patterns in life-like automaton (2010)
Book Chapter
We study a Life-like cellular automaton rule B2/S2345 where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This automaton i... Read More about Computation with competing patterns in life-like automaton.
Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton (2010)
Journal Article
We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state two-dimensional cellu... Read More about Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton.
Towards Physarum binary adders (2010)
Journal Article
Plasmodium of Physarum polycephalum is a single cell visible by unaided eye. The plasmodium's foraging behaviour is interpreted in terms of computation. Input data is a configuration of nutrients, result of computation is a network of plasmodium's cy... Read More about Towards Physarum binary adders.
Computation with competing patterns in Life-like automaton: Binary adder implementation (2010)
Presentation / Conference Contribution
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behaviour yet capable for purposeful computation. The automaton implements Boolean gates via patterns which compete for the space when propagate in channels. Value... Read More about Computation with competing patterns in Life-like automaton: Binary adder implementation.
How to make dull cellular automata complex by adding memory: Rule 126 case study (2010)
Journal Article
Using Rule 126 elementary cellular automaton (ECA), we demonstrate that a chaotic discrete system - when enriched with memory - hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced from original... Read More about How to make dull cellular automata complex by adding memory: Rule 126 case study.