Related papers: Evolution of natural patterns from random fields
The rate-limiting step of some enzymatic reactions is a physical step, i.e. diffusion. The efficiency of such reactions can be improved through an increase in the arrival rate of the substrate molecules, e.g. by a directed passage of…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…
In this paper, we formalize precisely the sense in which the application of cellular automaton to partial configuration is a natural extension of its local transition function through the categorical notion of Kan extension. In fact, the…
The objective is the design of a Cellular Automata rule that can form patterns with 'touching' loops. A loop is defined as a closed path of 1-cells in a 2D grid on a zero background and with a zero border. A path cell is connected with two…
One technique for creating semiconductor crystals with new, desired properties involves replacing some atoms in the crystal lattice with additives - atoms of a different type. This substitution not only alters the bulk properties of the…
The original Hardenberg's model of biomass patterns in arid and semi-arid regions is revisited to extend it to more general non flat regions. It is proposed a technique to study these more generalized (non-flat) regions using both a…
We present a simple model for describing the dynamics of the interaction between a homogeneous population or society, and the natural resources and reserves that the society needs for its survival. The model is formulated in terms of…
The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
Can we quantify the change of complexity throughout evolutionary processes? We attempt to address this question through an empirical approach. In very general terms, we simulate two simple organisms on a computer that compete over limited…
Modeling the ability of multicellular organisms to build and maintain their bodies through local interactions between individual cells (morphogenesis) is a long-standing challenge of developmental biology. Recently, the Neural Cellular…
The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules…
Self-organizing complex systems can be modeled using cellular automaton models. However, the parametrization of these models is crucial and significantly determines the resulting structural pattern. In this research, we introduce and…
Neural Cellular Automata (NCAs) are a model of morphogenesis, capable of growing two-dimensional artificial organisms from a single seed cell. In this paper, we show that NCAs can be trained to respond to signals. Two types of signal are…
A family of multi-value cellular automaton (CA) associated with traffic flow is presented in this paper. The family is obtained by extending the rule-184 CA, which is an ultradiscrete analogue to the Burgers equation. CA models in the…
Young's cellular automaton, recently applied to study the spatiotemporal evolution of binary patterns for favorable/hostile environments, has now been modified from a different point of view. In this model, each differentiated cell (DC)…
Spontaneous self-replication in cellular automata has long been considered rare, with most known examples requiring careful design or artificial initialization. In this paper, we present formal, causal evidence that such replication can…
Artificial organisms are computer programs that self-replicate, mutate, compete and evolve. How do these lifelike information-processing behaviours could arise in diverse far-from-equilibrium physical systems remains an open question. Here,…
Simple elastic models of spin-crossover compounds are known empirically to exhibit classical critical behavior. We demonstrate how the long-ranged interactions responsible for this behavior arise naturally upon integrating out mechanical…
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…