Related papers: Pattern Formation without Favored Local Interactio…
We explore the emergence of intelligent behavior in artificial systems by investigating how the complexity of rule-based systems influences the capabilities of models trained to predict these rules. Our study focuses on elementary cellular…
Motivated by questions in biology and distributed computing, we investigate the behaviour of particular cellular automata, modelled as one-dimensional arrays of identical finite automata. We investigate what sort of self-stabilising…
We map cell-state transition rules of elementary cellular automata (ECA) onto the cognitive control versus schizotypy spectrum phase space and interpret cellular automaton behaviour in terms of creativity. To implement the mapping we draw…
We consider the problem of finding the density of 1's in a configuration obtained by $n$ iterations of a given cellular automaton (CA) rule, starting from disordered initial condition. While this problems is intractable in full generality…
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…
Elementary cellular automata deterministically map a binary sequence to another using simple local rules. Visualizing the structure of this mapping is difficult because the number of nodes (i.e. possible binary sequences) grows…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…
We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing…
In this paper, we study the effect of (a)synchronism on the dynamics of elementary cellular automata. Within the framework of our study, we choose five distinct update schemes, selected from the family of periodic update modes: parallel,…
In this paper we consider a microscopic model of a simple ecosystem. The basic ingredients of this model are individuals, and both the phenotypic and genotypic levels are taken in account. The model is based on a long range cellular…
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
Spatiotemporal patterns are common in biological systems. For electrically-coupled cells previous studies of pattern formation have mainly used external forcing as the main bifurcation parameter. The purpose of this paper is to show that…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
The spontaneous generation of electrical activity underpins a number of essential physiological processes, and is observed even in tissues where specialized pacemaker cells have not been identified. The emergence of periodic oscillations in…