367 search results - page 37 / 74 » Cellular automata |
115
click to vote
TCS
2011
14 years 6 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
120
click to vote
PACT
2005
Springer
15 years 5 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
111
click to vote
TCS
2011
14 years 6 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
ECAL
2001
Springer
15 years 4 months ago
2001
Springer
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...
110
click to vote
FGCS
2007
14 years 11 months ago
2007
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...