Related papers: On elementary cellular automata asymptotic (a)sync…
Many computer models such as cellular automata and artificial neural networks have been developed and successfully applied. However, in some cases, these models might be restrictive on the possible solutions or their solutions might be…
A deterministic cellular automaton rule defined on the Moore neighbourhood is studied as a model of epidemic propagation. The directed nature of the interaction between cells allows one to introduce the dependence on a disorder parameter…
Synchronization is a phenomenon where interacting particles lock their motion and display non-trivial dynamics. Despite intense efforts studying synchronization in systems without clear classical limits, no comprehensive theory has been…
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. They are studied both from the…
A digit function is presented which provides the $i$th-digit in base $p$ of any real number $x$. By means of this function, formulated within $\mathcal{B}$-calculus, the local, nonlocal and global dynamical behaviors of cellular automata…
Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case), under all possible update rules (asynchronicity). Over the torus Z/nZ (n<= 11),we will see…
Cellular automata (CA) dynamics are ordered in terms of two global parameters, computable {\sl a priori} from the description of rules. While one of them (activity) has been used before, the second one is new; it estimates the average…
We study the effects of nonzero time delays in stochastic synchronization problems with linear couplings in complex networks. We consider two types of time delays: transmission delays between interacting nodes and local delays at each node…
Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…
Given a finite set of local constraints, we seek a cellular automaton (i.e., a local and uniform algorithm) that self-stabilises on the configurations that satisfy these constraints. More precisely, starting from a finite perturbation of a…
Neural circuits are able to perform computations under very diverse conditions and requirements. The required computations impose clear constraints on their fine-tuning: a rapid and maximally informative response to stimuli in general…
The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their…
In this exploratory paper we introduce the problem of cognitive agents that learn how to modify their environment according to local sensing to reach a global goal. We concentrate on discrete dynamics (cellular automata) on a…
The prediction of the behavior of the disease, the level of affectation in a population and the ways to control it are the most important aspects studied by epidemiology using tools such as historical data and mathematical models. So, our…
We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…
The hard problem in artificial intelligence asks how the shuffling of syntactical symbols in a program can lead to systems which experience semantics and qualia. We address this question in three stages. First, we introduce a new class of…
In this work we investigate time varying networks with complex dynamics at the nodes. We consider two scenarios of network change in an interval of time: first, we have the case where each link can change with probability pt, i.e. the…
The paper addresses the synchronization of multi-agent systems with continuous-time dynamics interacting through a very general class of monotonic continuous signal functions that covers estimation biases, approximation of discrete…
We have developed a simple cellular automata model for nonlinearly coupled phase oscillators which can exhibit many important collective dynamical states found in other synchronizing systems. The state of our system is specified by a set of…
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system --- when enriched with memory -- hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced…