Searcharxiv⌕ Search

arXiv subjects

Andrew Adamatzky

Publications and source records attributed to Andrew Adamatzky.

230 records · Page 13Linked to original sources
arXiv2009

Hot Ice Computer

We experimentally demonstrate that supersaturated solution of sodium acetate, commonly called 'hot ice', is a massively-parallel unconventional computer. In the hot ice computer data are represented by a spatial configuration of crystallization induction sites and physical obstacles immersed in the experimental container. Computation is implemented by propagation and interaction of growing crystals initiated at the data-sites. We discuss experimental prototypes of hot ice processors which compute planar Voronoi diagram, shortest collision-free paths and implement AND and OR logical gates.

nlin.PS↗
arXiv2009

Steering plasmodium with light: Dynamical programming of Physarum machine

A plasmodium of Physarum polycephalum is a very large cell visible by unaided eye. The plasmodium is capable for distributed sensing, parallel information processing, and decentralized optimization. It is an ideal substrate for future and emerging bio-computing devices. We study space-time dynamics of plasmodium reactiom to localised illumination, and provide analogies between propagating plasmodium and travelling wave-fragments in excitable media. We show how plasmodium-based computing devices can be precisely controlled and shaped by planar domains of illumination.

nlin.PS↗
arXiv2009

Localization dynamics in a binary two-dimensional cellular automaton: the Diffusion Rule

We study a two-dimensional cellular automaton (CA), called Diffusion Rule (DR), which exhibits diffusion-like dynamics of propagating patterns. In computational experiments we discover a wide range of mobile and stationary localizations (gliders, oscillators, glider guns, puffer trains, etc), analyze spatio-temporal dynamics of collisions between localizations, and discuss possible applications in unconventional computing.

cs.FL↗
arXiv2009

Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton

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 cellular automaton -- a finite-state machine imitation of an activator-inhibitor reaction-diffusion system. The activator is self-inhibited in certain concentrations. The inhibitor dissociates in the absence of the activator. The Spiral Rule cellular automaton has rich spatio-temporal dynamics of traveling (glider) and stationary (eater) patterns. When a glider brushes an eater the eater may slightly change its configuration, which is updated once more every next hit. We encode binary strings in the states of eaters and sequences of gliders. We study what types of binary compositions of binary strings are implementable by sequences of gliders brushing an eater. The models developed will be used in future laboratory designs of reaction-diffusion chemical computers.

cs.FL↗
arXiv2009

Complex dynamics emerging in Rule 30 with majority memory

In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and show that using the memory function we can transform quasi-chaotic dynamics of classical Rule 30 into domains of travelling structures with predictable behaviour. We analyse morphological complexity of the automata and classify dynamics of gliders (particles, self-localizations) in memory-enriched Rule 30. We provide formal ways of encoding and classifying glider dynamics using de Bruijn diagrams, soliton reactions and quasi-chemical representations.

nlin.CG↗
arXiv2009

Implementation of Glider Guns in the Light-Sensitive Belousov-Zhabotinsky Medium

In cellular automata models a glider gun is an oscillating pattern of non-quiescent states that periodically emits traveling localizations (gliders). The glider streams can be combined to construct functionally complete systems of logical gates and thus realize universal computation. The glider gun is the only means of ensuring the negation operation without additional external input and therefore is an essential component of a collision-based computing circuit. We demonstrate the existence of glider gun like structures in both experimental and numerical studies of an excitable chemical system -- the light-sensitive Belousov-Zhabotinsky reaction. These discoveries could provide the basis for future designs of collision-based reaction-diffusion computers.

nlin.PS↗
arXiv2009

On localizations in minimal cellular automata model of two-species mutualism

A mutualism is an interaction where the involved species benefit from each other. We study a two-dimensional hexagonal three-state cellular automaton model of a two-species mutualistic system. The simple model is characterized by four parameters of propagation and survival dependencies between the species. We map the parametric set onto the basic types of space-time structures emerged in the mutualistic population dynamic. The structures discovered include propagating quasi-one dimensional patterns, very slowly growing clusters, still and oscillatory stationary localizations. Although we hardly find such idealized patterns in nature, due to increased complexity of interaction phenomena, we recognize our findings as basic spatial patterns of mutualistic systems, which can be used as baseline to build up more complex models.

nlin.CG↗
arXiv2009

Programmable reconfiguration of Physarum machines

Plasmodium of Physarum polycephalum is a large cell capable of solving graph-theoretic, optimization and computational geometry problems due to its unique foraging behavior. Also the plasmodium is unique biological substrate that mimics universal storage modification machines, namely the Kolmogorov-Uspensky machine. In the plasmodium implementation of the storage modification machine data are represented by sources of nutrients and memory structure by protoplasmic tubes connecting the sources. In laboratory experiments and simulation we demonstrate how the plasmodium-based storage modification machine can be programmed. We show execution of the following operations with active zone (where computation occurs): merge two active zones, multiple active zone, translate active zone from one data site to another, direct active zone. Results of the paper bear two-fold value: they provide a basis for programming unconventional devices based on biological substrates and also shed light on behavioral patterns of the plasmodium.

nlin.AO↗
arXiv2009

Physarum boats: If plasmodium sailed it would never leave a port

Plasmodium of \emph{Physarum polycephalum} is a single huge (visible by naked eye) cell with myriad of nuclei. The plasmodium is a promising substrate for non-classical, nature-inspired, computing devices. It is capable for approximation of shortest path, computation of planar proximity graphs and plane tessellations, primitive memory and decision-making. The unique properties of the plasmodium make it an ideal candidate for a role of amorphous biological robots with massive parallel information processing and distributed inputs and outputs. We show that when adhered to light-weight object resting on a water surface the plasmodium can propel the object by oscillating its protoplasmic pseudopodia. In experimental laboratory conditions and computational experiments we study phenomenology of the plasmodium-floater system, and possible mechanisms of controlling motion of objects propelled by on board plasmodium.

cs.RO↗
arXiv2008

Towards Physarum robots: computing and manipulating on water surface

Plasmodium of Physarym polycephalum is an ideal biological substrate for implementing concurrent and parallel computation, including combinatorial geometry and optimization on graphs. We report results of scoping experiments on Physarum computing in conditions of minimal friction, on the water surface. We show that plasmodium of Physarum is capable for computing a basic spanning trees and manipulating of light-weight objects. We speculate that our results pave the pathways towards design and implementation of amorphous biological robots.

cs.RO↗
arXiv2008

On logical gates in precipitating medium: cellular automaton model

We study a two-dimensional semi-totalistic binary cell-state cellular automaton, which imitates a reversible precipitation in an abstract chemical medium. The systems exhibits a non-trivial growth and nucleation. We demonstrate how basic computational operation can be realized in the system when the propagation of the growing patterns is self-restricted by stationary localizations. We show that precipitating patterns of different morphology compete between each other and thus implement serial and non-serial logical gates.

nlin.CG↗
arXiv2007

Evolving localizations in reaction-diffusion cellular automata

We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are in each one state. We employ evolutionary algorithms to breed local transition functions that support mobile localizations (gliders), and characterize sets of the functions selected in terms of quasi-chemical systems. Analysis of the set of functions evolved allows to speculate that mobile localizations are likely to emerge in the quasi-chemical systems with limited diffusion of one reagent, a small number of molecules is required for amplification of travelling localizations, and reactions leading to stationary localizations involve relatively equal amount of quasi-chemical species. Techniques developed can be applied in cascading signals in nature-inspired spatially extended computing devices, and phenomenological studies and classification of non-linear discrete systems.

cs.AI↗
arXiv2007

Universal computation with limited resources: Belousov-Zhabotinsky and Physarum computers

Using the examples of an excitable chemical system (Belousov-Zhabotinsky medium) and plasmodium of Physarum polycephalum we show that universal computation in a geometrically unconstrained medium is only possible when resources (excitability or concentration of nutrients) are limited. In situations of limited resources the systems studied develop travelling localizations. The localizations are elementary units of dynamical logical circuits in collision-based computing architectures.

nlin.PS↗