Related papers: Astrobiological Complexity with Probabilistic Cell…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
Let us consider the simplest model of one-dimensional probabilistic cellular automata (PCA). The cells are indexed by the integers, the alphabet is {0, 1}, and all the cells evolve synchronously. The new content of a cell is randomly…
Cellular Automata(CA) is a discrete computing model which provides simple, flexible and efficient platform for simulating complicated systems and performing complex computation based on the neighborhoods information. CA consists of two…
Probabilistic Cellular Automata are extended stochastic systems, widely used for modelling phenomena in many disciplines. The possibility of controlling their behaviour is therefore an important topic. We shall present here an approach to…
We present a preliminary results of our Galactic Habitable Zone (GHZ) 2D probabilistic cellular automata models. The relevant time-scales (emergence of life, it's diversification and evolution influenced with the global risk function) are…
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…
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…
The probabilistic cellular automaton (PCA) method is highlighted for its relatively simple numerical algorithm and low computational cost in the simulation of microstructural evolution. In this method, probabilistic state change rules are…
Context. Astrobiological evolution of the Milky Way (or the shape of its "astrobiological landscape") has emerged as one of the key research topics in recent years. In order to build precise, quantitative models of the Galactic…
Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a…
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
We propose some conjectures for asymptotic distribution of probabilistic Burgers cellular automaton (PBCA) which is defined by a simple motion rule of particles including a probabilistic parameter. Asymptotic distribution of configurations…
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…