Sciweavers

4 search results - page 1 / 1
» Integer Gradient for Cellular Automata: Principle and Exampl...
Sort
View
SASO
2008
IEEE
13 years 11 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
ACRI
2004
Springer
13 years 10 months ago
Heredity, Complexity, and Surprise: Embedded Self-Replication and Evolution in CA
Abstract. This paper reviews the history of embedded, evolvable selfreplicating structures implemented as cellular automata systems. We relate recent advances in this field to the...
Chris Salzberg, Hiroki Sayama
MCU
2004
126views Hardware» more  MCU 2004»
13 years 6 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
UPP
2004
Springer
13 years 10 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes