Related papers: Free fall and cellular automata
We study a cellular automaton model, which allows diffusion of energy (or equivalently any other physical quantities such as mass of a particular compound) at every lattice site after each timestep. Unit amount of energy is randomly added…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on an operation of rescaling is receiving more and more…
Generalizing the motion representation we introduced for number-conserving rules, we give a systematic way to construct a generalized motion representation valid for non-conservative rules using the expression of the current, which appears…
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…
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…
This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators. It subsequently uses this formalism to analyze and validate several conjectures, stemming…
Landslide inventories show that the statistical distribution of the area of recorded events is well described by a power law over a range of decades. To understand these distributions, we consider a cellular automaton to model a time and…
Recent advances on quantum foundations achieved the derivation of free quantum field theory from general principles, without referring to mechanical notions and relativistic invariance. From the aforementioned principles a quantum cellular…
We present a quantum theory of light based on quantum cellular automata (QCA). This approach allows us to have a thorough quantum theory of free electrodynamics encompassing an hypothetical discrete Planck scale. The theory is particularly…
Noise in the local transition function is compared to fluctuations in the updating times of the cells. Obtained results are shown to be quite different in both cases. In this extended abstract we briefly explain the problem and present…
We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an…
From the mesoscopic point of view, a new concept of soft matching for mass points is proposed. Then a soft Lasso's approach to learn the soft dynamical equation for the physical mechanical relationship is proposed, too. Furthermore, a…
We investigate a connection between a property of the distribution and a conserved quantity for the reversible cellular automaton derived from a discrete-time quantum walk in one dimension. As a corollary, we give a detailed information of…
In this paper we initiate the study of cellular automata on racks. A rack $R$ is a set with a self-distributive binary operation. The rack $R$ acts on the set $A^R$ of configurations from $R$ to a set $A$. We define the cellular automaton…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
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…
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.