Andrew Adamatzky's Outputs (14)

Dynamics of excitation in F-actin: Automaton model (2024)
Book Chapter

We propose a model called the F-actin automaton, which represents a filamentous actin molecule as a graph of finite state machines. Each node in the graph can be in one of three states: resting, excited, or refractory. The states of all nodes are upd... Read More about Dynamics of excitation in F-actin: Automaton model.

A haploid-diploid evolutionary algorithm optimizing nanoparticle based cancer treatments (2022)
Book Chapter

This paper uses a recent explanation for the fundamental haploid-diploid lifecycle of eukaryotic organisms to present a new evolutionary algorithm that differs from all previous known work using diploid representations. A form of the Baldwin effect h... Read More about A haploid-diploid evolutionary algorithm optimizing nanoparticle based cancer treatments.

Phase transitions in swarm optimization algorithms (2018)
Book Chapter

Natural systems often exhibit chaotic behavior in their space-time evolution. Systems transiting between chaos and order manifest a potential to compute, as shown with cellular automata and artificial neural networks. We demonstrate that swarms optim... Read More about Phase transitions in swarm optimization algorithms.

Computers from plants (2018)
Book Chapter

Plants are highly intelligent organisms. They continuously make distributed processing of sensory information, concurrent decision making and parallel actuation. The plants are efficient green computers per se. Outside in nature, the plants are progr... Read More about Computers from plants.

Discovering Boolean gates in slime mould (2018)
Book Chapter

Slime mould of Physarum polycephalum is a large cell exhibiting rich spatial non-linear electrical characteristics. We exploit the electrical properties of the slime mould to implement logic gates using a flexible hardware platform designed for inves... Read More about Discovering Boolean gates in slime mould.

A computation in a cellular automaton collider rule 110 (2016)
Book Chapter

A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations). The constru... Read More about A computation in a cellular automaton collider rule 110.

Cellular automaton manipulator array (2014)
Book Chapter

Toward turing’s A-type unorganised machines in an unconventional substrate: A dynamic representation in compartmentalised excitable chemical media (2013)
Book Chapter

© Springer-Verlag Berlin Heidelberg 2013. Turing presented a general representation scheme by which to achieve artificial intelligence – unorganised machines. Significantly, these were a form of discrete dynamical system and yet such representations... Read More about Toward turing’s A-type unorganised machines in an unconventional substrate: A dynamic representation in compartmentalised excitable chemical media.

Different behaviour seen in flexible titanium dioxide sol-gel memristors dependent on the choice of electrode material (2012)
Book Chapter

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.

Reaction-diffusion controllers for robots (2009)
Book Chapter

Excitable systems, particularly spatially extended media, exhibit a wide variety of travelling patterns and different modes of interaction. The Belousov-Zhabo-tinsky [1] (BZ) reaction is the most well known and extensively studied example of non-line... Read More about Reaction-diffusion controllers for robots.

Coevolving cellular automata with memory for chemical computing: Boolean logic gates in the BZ reaction (2008)
Book Chapter

Computation by competing patterns: life rule B2/S2345678 (2008)
Book Chapter

Patterns, originating from different sources of perturbations, propagating in a precipitating chemical medium do usually compete for the space. They sub-divide the medium onto the regions unique for an initial configuration of disturbances. This sub-... Read More about Computation by competing patterns: life rule B2/S2345678.

Towards machine learning control of chemical computers (2006)
Book Chapter