Results 161 to 170 of about 8,845 (199)
Some of the next articles are maybe not open access.
A Physically Universal Cellular Automaton
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015Several cellular automata (CA) are known to be universal in the sense that one can simulate arbitrary computations (e.g., circuits or Turing machines) by carefully encoding the computational device and its input into the cells of the CA. In this paper, we consider a different kind of universality proposed by Janzing.
openaire +2 more sources
1999
What is in this chapter? Cellular automata are widely used models in mathematical physics and in theoretical biology. These systems start from a random state and then evolve using deterministic rules, with time being discrete. We concentrate on a specific model in this chapter. We define the initial configuration as follows.
openaire +1 more source
What is in this chapter? Cellular automata are widely used models in mathematical physics and in theoretical biology. These systems start from a random state and then evolve using deterministic rules, with time being discrete. We concentrate on a specific model in this chapter. We define the initial configuration as follows.
openaire +1 more source
A NEW UNIVERSAL CELLULAR AUTOMATON ON THE PENTAGRID
Parallel Processing Letters, 2009In this paper, we significantly improve a result of the first author, published in an issue of Theoretical Computer Science in 2003. In this paper, the authors showed the existence of a weakly universal cellular automaton on the pentagrid with 22 states. The simulation used a railway circuit which simulates a register machine.
Maurice Margenstern, Yu Song
openaire +1 more source
The Quantum Cellular Automaton as a Markov Process
Chaos, Solitons & Fractals, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fitzpatrick, M. +5 more
openaire +2 more sources
A cellular automaton for Burgers' equation
Complex Syst., 1987The authors develop and analyze a cellular automaton for the simulation of Burgers' equation. The automaton consists of moving `particles' on a one-dimensional periodic lattice with speed one and in a random direction subject to the exclusion principle that at most one particle may move in a given direction from a given lattice site, at a given time ...
Bruce M. Boghosian, C. David Levermore
openaire +2 more sources
Attractor vicinity decay for a cellular automaton
Chaos: An Interdisciplinary Journal of Nonlinear Science, 1993The temporal decay of an attractor’s vicinity for a domain-wall dominated cellular automaton (CA) is studied. Using selected initial pattern ensembles, state space structures in this high-dimensional nonlinear spatial system can be identified via the resulting decay to its attractors.
Crutchfield, James P., Hanson, James E.
openaire +2 more sources
The attractor?basin portrait of a cellular automaton
Journal of Statistical Physics, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanson, James E., Crutchfield, James P.
openaire +2 more sources
2016
Abstract This chapter formalizes spatial strategic interaction as games on grids. It develops cellular automata examples ranging from Conway’s classic Game of Life to complex cooperation, and revisits several earlier examples of assortative and disassortative interactions in an explicit spatial framework. The chapter features simulations
Daniel Friedman, Barry Sinervo
openaire +1 more source
Abstract This chapter formalizes spatial strategic interaction as games on grids. It develops cellular automata examples ranging from Conway’s classic Game of Life to complex cooperation, and revisits several earlier examples of assortative and disassortative interactions in an explicit spatial framework. The chapter features simulations
Daniel Friedman, Barry Sinervo
openaire +1 more source
Avalanches in a cellular automaton
Physical Review E, 1995, Romero-Rochín +3 more
openaire +2 more sources