Computer Science – Computational Complexity
Scientific paper
2009-06-17
EPTCS 1, 2009, pp. 205-214
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.1.20
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of colliding signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting particles. We obtain a high-level construction for a new smallest intrinsically universal cellular automaton with 4 states.
Ollinger Nicolas
Richard Gaétan
No associations
LandOfFree
A Particular Universal Cellular Automaton does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Particular Universal Cellular Automaton, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Particular Universal Cellular Automaton will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-223578