217 search results - page 7 / 44 » Computational complexity of dynamical systems: The case of c... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
AC
1998
Springer
13 years 7 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
TCS
2011
13 years 2 months ago
2011
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...