相关论文: Cellular Automata under the influence of noise

Defining the density flow of perturbations moving at a given speed for cellular automata, we establish equalities and inequalities between the measurable entropy of a cellular automaton and the measurable entropy of its associated shift.

We investigate cellular automata where some global quantity varies periodically or quasiperiodically with time. We find that these systems are highly predictable, and can be rather well described by a set of mean-field variables. We…

We consider reversible and surjective cellular automata perturbed with noise. We show that, in the presence of positive additive noise, the cellular automaton forgets all the information regarding its initial configuration exponentially…

Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we investigate explicitly how coherence is built and lost in the evolution of one-dimensional automata…

Quantitative single cell measurements have shown that cell cycle duration (the time between cell divisions) for diverse cell types is a noisy variable. The underlying distribution is mean scalable with a universal shape for many cell types…

The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on…

We explore some aspects of phase transitions in cellular automata. We start recalling the standard formulation of statistical mechanics of discrete systems (Ising model), illustrating the Monte Carlo approach as Markov chains and stochastic…

Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…

We present a stochastic neural automata in which activity fluctuations and synaptic intensities evolve at different temperature, the latter moving through a set of stored patterns. The network thus exhibits various retrieval phases,…

This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…

Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…

Thermal noise in a cellular automaton refers to a random perturbation to its function which eventually leads this automaton to an equilibrium state controlled by a temperature parameter. We study the 1-dimensional majority-3 cellular…

We introduce a class of noisy quantum cellular automata on a qubit lattice that includes all classical Markov chains, as well as maps where quantum coherence between sites is allowed to build up over time. We apply such a construction to…

The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the…

The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…

The positive rates conjecture states that a one-dimensional probabilistic cellular automaton (PCA) with strictly positive transition rates must be ergodic. The conjecture has been refuted by G\'acs, whose counterexample is a cellular…

We studied neural automata -or neurobiologically inspired cellular automata- which exhibits chaotic itinerancy among the different stored patterns or memories. This is a consequence of activity-dependent synaptic fluctuations, which…

Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…

In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the…

Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to…