Related papers: On elementary cellular automata asymptotic (a)sync…
The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules…
In the present article we emphasize the importance of modeling time in the context of agent-based models. To this end, we present a (selective) survey of the Cellular Automata-literature on updating and draw parallels to the issue of agent…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. The global dynamics of the network…
In this work, we study the dynamic range in a neuronal network modelled by cellular automaton. We consider deterministic and non-deterministic rules to simulate electrical and chemical synapses. Chemical synapses have an intrinsic…
We compare asynchronous vs. synchronous update of discrete dynamical networks and find that a simple time delay in the nodes may induce a reproducible deterministic dynamics even in the case of asynchronous update in random order. In…
Recent research has provided a wealth of evidence highlighting the pivotal role of high-order interdependencies in supporting the information-processing capabilities of distributed complex systems. These findings may suggest that high-order…
A small-world cellular automaton network has been formulated to simulate the long-range interactions of complex networks using unconventional computing methods in this paper. Conventional cellular automata use local updating rules. The new…
In [11] and [13] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugation, reflection, reflected-conjugation) are not maximum…
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…
Commonly studied cellular automata are memoryless and have fixed topology of connections between cells. However by allowing updates of links and short-term memory in cells we may potentially discover novel complex regimes of spatio-temporal…
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…
In the dynamics of open quantum systems, the interaction with the external environment usually leads to a contraction of the set of reachable states for the system as time increases, eventually shrinking to a single stationary point. In…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
We study the impact of competing time delays in coupled stochastic synchronization and coordination problems. We consider two types of delays: transmission delays between interacting elements and processing, cognitive, or execution delays…
In this paper, we perform a theoretical analysis of the sequential convergence of elementary cellular automata that have at least one fixed point. Our aim is to establish which elementary rules always reach fixed points under sequential…
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…
We investigate elementary cellular automata (ECA) from the point of view of (discrete) dynamical systems. By studying small lattice sizes, we obtain the complete phase space of all minimal ECA, and, starting from a maximal entropy…
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…
Shared resource interference is observed by applications as dynamic performance asymmetry. Prior art has developed approaches to reduce the impact of performance asymmetry mainly at the operating system and architectural levels. In this…