Related papers: Cellular Automation of Galactic Habitable Zone
One key challenge in Artificial Life is designing systems that display an emergence of complex behaviors. Many such systems depend on a high-dimensional parameter space, only a small subset of which displays interesting dynamics. Focusing…
The notion of a Galactic Habitable Zone (GHZ), or regions of the Milky Way galaxy that preferentially maintain the conditions to sustain complex life, has recently gained attention due to the detection of numerous exoplanets and advances…
We study a probabilistic cellular automaton to describe two population biology problems: the threshold of species coexistence in a predator-prey system and the spreading of an epidemic in a population. By carrying out time-dependent…
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 present an exact renormalisation scheme for fermionic cellular automata on hypercubic lattices. By grouping neighbouring cells into tiles and selecting subspaces within them, multiple evolution steps on the original system correspond to…
We have computed the Galactic Habitable Zones (GHZs) of the Andromeda galaxy (M31) based on the probability of terrestrial planet formation, which depends on the metallicity (Z) of the interstellar medium, and the number of formed stars per…
We present the first model that couples high-resolution simulations of the formation of Local Group galaxies with calculations of the galactic habitable zone (GHZ), a region of space which has sufficient metallicity to form terrestrial…
We present results from an experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task. Packard examined the frequency of evolved CA…
We study one-dimensional cellular automata evolutions with both temporal and spatial periodicity. The main objective is to investigate the longest temporal periods among all two-neighbor rules, with a fixed spatial period $\sigma$ and…
What substrate features allow life? We exhaustively classify all 262,144 outer-totalistic binary cellular automata rules with Moore neighbourhood for self-replication and produce phase diagrams in the $(\lambda, F)$ plane, where $\lambda$…
The Fermi Paradox is the apparent contradiction between the high probability extraterrestrial civilizations' existence and the lack of contact with such civilizations. In general, solutions to Fermi's paradox come down to either estimation…
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class.…
The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at…
We investigate epidemic models with spatial structure based on the cellular automata method. The construction of the cellular automata is from the study by Weimar and Boon about the reaction-diffusion equations [Phys. Rev. E 49, 1749…
We introduce a new class of probabilistic cellular automata that are capable of exhibiting rich dynamics such as synchronization and ergodicity and can be easily inferred from data. The system is a finite-state locally interacting Markov…
Agent-based (AB) or Cellular Automata (CA) models are rule based and are a relatively simple discrete method that can be used to simulate complex interactions of many agents or cells. The relative ease of implementing the computational…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
The phase diagram of the coupled sine circle map lattice exhibits a variety of interesting phenomena including spreading regions with spatiotemporal intermittency, non-spreading regions with spatial intermittency, and coherent structures…