50 search results - page 6 / 10 » Intrinsically Universal Cellular Automata |
ICANN
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
LATIN
1995
Springer
13 years 11 months ago
1995
Springer
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
AE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We aim to construct an automatic system for the discovery of collision-based universal cellular automata that simulate Turing machines in their space-time dynamics using ...
DNA
2005
Springer
14 years 1 months ago
2005
Springer
Recent experimental progress in DNA lattice construction, DNA robotics, and DNA computing provides the basis for designing DNA cellular computing devices, i.e. autonomous nano-mech...
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...