Related papers: Free fall and cellular automata
In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…
Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
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…
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 present applications of a cellular automaton approach to pedestrian dynamics introduced in [1,2]. It is shown that the model is able to reproduce collective effects and self-organization phenomena encountered in pedestrian traffic, e.g.…
Cellular automata represent physical systems where both space and time are discrete, and the associated physical quantities assume a limited set of values. While previous research has applied cellular automata in modeling chemical,…
We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…
Cellular automata provide a fascinating class of dynamical systems capable of diverse complex behavior. These include simplified models for many phenomena seen in nature. Among other things, they provide insight into self-organized…
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-automatic local transition functions. In this approach we…
A cellular automaton named Rule 184++C is proposed as a meta-model to investigate the flow of various complex particles. In this model, unlike the granular pipe flow and the traffic flow, not only the free-jam phase transition but also the…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
We construct a cellular automaton (CA) model that describes the movement of a particle in a disordered system. The mathematical properties of the CA model were examined by varying the configuration of grid and determining the number of…
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…
In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…
This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results…
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…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
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…
This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation behave in two opposite ways with respect to the complexity…