Results 21 to 30 of about 9,104 (106)

Synchronization of non-chaotic dynamical systems

open access: yes, 1999
A synchronization mechanism driven by annealed noise is studied for two replicas of a coupled-map lattice which exhibits stable chaos (SC), i.e. irregular behavior despite a negative Lyapunov spectrum. We show that the observed synchronization transition,
Bagnoli   +28 more
core   +4 more sources

Computational Aspects of Asynchronous CA [PDF]

open access: yes, 2011
This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines.
Chandesris, Jérôme   +3 more
core  

Application of a renormalization group algorithm to nonequilibrium cellular automata with one absorbing state

open access: yes, 1998
We improve a recently proposed dynamically driven renormalization group algorithm for cellular automata systems with one absorbing state, introducing spatial correlations in the expression for the transition probabilities.
A. Bunde   +16 more
core   +1 more source

Is there a physically universal cellular automaton or Hamiltonian? [PDF]

open access: yes, 2010
It is known that both quantum and classical cellular automata (CA) exist that are computationally universal in the sense that they can simulate, after appropriate initialization, any quantum or classical computation, respectively.
Janzing, Dominik
core  

The Garden of Eden theorem: old and new

open access: yes, 2018
We review topics in the theory of cellular automata and dynamical systems that are related to the Moore-Myhill Garden of Eden theorem.Comment: This is a further updated version; it includes an INDEX. To appear in Handbook of Group Actions, (ed. L.
Ceccherini-Silberstein, Tullio   +1 more
core  

Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations [PDF]

open access: yes, 1993
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.
Crutchfield, James P.   +2 more
core   +4 more sources

Astrobiological Complexity with Probabilistic Cellular Automata

open access: yes, 2012
Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion.
A Ilachinski   +99 more
core   +1 more source

Evolving Gene Regulatory Networks with Mobile DNA Mechanisms

open access: yes, 2013
This paper uses a recently presented abstract, tuneable Boolean regulatory network model extended to consider aspects of mobile DNA, such as transposons.
Adamatzky, Andrew, Bull, Larry
core   +1 more source

Cellular automata and self-organized criticality [PDF]

open access: yes, 1996
Cellular automata provide a fascinating class of dynamical systems capable of diverse complex behavior. These include simplified models for many phenomena seen in nature.
Creutz, Michael
core   +2 more sources

Quantumness of discrete Hamiltonian cellular automata

open access: yes, 2014
We summarize a recent study of discrete (integer-valued) Hamiltonian cellular automata (CA) showing that their dynamics can only be consistently defined, if it is linear in the same sense as unitary evolution described by the Schr\"odinger equation. This
Elze, Hans-Thomas
core   +2 more sources

Home - About - Disclaimer - Privacy