Sciweavers

62 search results - page 2 / 13
» Minimizing Complexity in Cellular Automata Models of Self-Re...
Sort
View
ECAL
2001
Springer
13 years 9 months ago
Fault-Tolerant Structures: Towards Robust Self-Replication in a Probabilistic Environment
Abstract. Self-replicating structures in cellular automata have been extensively studied in the past as models of Artificial Life. However, CAs, unlike the biological cellular mod...
Daniel C. Bünzli, Mathieu S. Capcarrèr...
IANDC
2008
139views more  IANDC 2008»
13 years 4 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
ICS
2010
Tsinghua U.
14 years 1 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
BCS
2008
13 years 6 months ago
Dynamic Neighbourhood Cellular Automata
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
Stefan S. Dantchev
COMPLEXITY
2010
108views more  COMPLEXITY 2010»
13 years 1 months ago
How to make dull cellular automata complex by adding memory: Rule 126 case study
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -- when enriched with memory
Genaro Juárez Martínez, Andrew Adama...