Related papers: Implementation of Glider Guns in the Light-Sensiti…
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively parallel non-linear computers, can be realised by such an…
Light-sensitive modification (ruthenium catalysed) of the Belousov-Zhabotinsky medium exhibits various regimes of excitability depending on the levels of illumination. For certain values of illumination the medium switches to a…
An elementary cellular automaton with memory is a chain of finite state machines (cells) updating their state simultaneously and by the same rule. Each cell updates its current state depending on current states of its immediate neighbours…
In a sub-excitable light-sensitive Belousov-Zhabotinsky chemical medium an asymmetric disturbance causes the formation of localized traveling wave-fragments. Under the right conditions these wave-fragment can conserve their shape and…
We present an experimental system of networks of coupled non-linear chemical reactors, which we theoretically model within a reaction-diffusion framework. The networks consist of patterned arrays of diffusively coupled nanoliter-scale…
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…
The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generators of the mobile patterns, glider guns, in its evolution. We…
In previous works, hexagonal cellular automata (CA) have been studied as a variation of the famous Game of Life CA, mainly for spiral phenomena simulations; where the most interesting constructions are related to the Belousov-Zhabotinsky…
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…
We present both simulated and partial empirical evidence for the computational utility of many connected vesicle analogs of an encapsulated non-linear chemical processing medium. By connecting small vesicles containing a solution of…
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).…
We study water-in-oil emulsion droplets, running the Belousov-Zhabotinsky reaction, that form a new type of active matter unit. These droplets, stabilised by surfactants dispersed in the oil medium, are capable of internal chemical…
The article describes results of the modified model of the Belousov-Zhabotinsky reaction, which resembles rather well the limit set observed upon experimental performance of the reaction in the Petri dish. We discuss the concept of the…
We present a new Life-like cellular automaton (CA) capable of logic universality -- the X-rule. The CA is 2D, binary, with a Moore neighborhood and $\lambda$ parameter similar to the game-of-Life, but is not based on birth/survival and is…
We propose a new method to construct an isotropic cellular automaton corresponding to a reaction-diffusion equation. The method consists of replacing the diffusion term and the reaction term of the reaction-diffusion equation with a random…
To understand the underlying principles of self-organisation and computation in cellular automata, it would be helpful to find the simplest form of the essential ingredients, glider-guns and eaters, because then the dynamics would be easier…
We present a novel computational framework for diffusive-reactive systems that satisfies the non-negative constraint and maximum principles on general computational grids. The governing equations for the concentration of reactants and…
Cellular automata (CA) are well-studied models of decentralized parallel computation, known for their ability to exhibit complex global behavior from simple local rules. While their dynamics have been widely explored through simulations, a…
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…
It has been shown that it is possible to transform a well-stirred chemical medium into a logic-gate simply by varying the chemistry's external conditions (feed rates, lighting conditions, etc). We extend this work, showing that the same…