Related papers: Flexible Time and the Evolution of One-Dimensional…
Flexible Time is a new formalism for calculations about one-dimensional cellular automata. It unifies the states of a finite number of cells into a single object, even if they occur at different times. This gives greater flexibility to…
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…
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rule-90 and 150. The time evolutions are described with matrices. Eigenvalue analysis is applied to clarify the…
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,…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
The total activity of the single-seeded cellular rule 150 automaton does not follow a one-step iteration like other elementary cellular automata, but can be solved as a two-step vectorial, or string, iteration, which can be viewed as a…
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…
A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic…
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…
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…
We investigate the ability of a genetic algorithm to design cellular automata that perform computations. The computational strategies of the resulting cellular automata can be understood using a framework in which ``particles'' embedded in…
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…
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
A cellular automata approach using a Directed Cyclic Graph is used to model interrelationships of fluctuating time, state and space. This model predicts phenomena including a constant and maximum speed at which any moving entity can travel,…
We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
We introduce an agent-based model for the spreading of technological developments in socio-economic systems where the technology is mainly used for the collaboration/interaction of agents. Agents use products of different technologies to…