Four states are enough!

Nicolas Ollinger (1) , Gaétan Richard (2)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166
2 Equipe AMACC - Laboratoire GREYC - UMR6072

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 to the Turing universality bound. Intrinsic universality is discussed. Construction and proof rely on a combination of bulking techniques with programming using particles and collisions.

Mots clés: Cellular automata; intrinsic universality; particles and collisions; bulking

Domaines: Autre [cs.OH]; Informatique [cs]

Nicolas Ollinger, Gaétan Richard. Four states are enough!. Theoretical Computer Science, 2011, 412 (1-2), pp.22-32. ⟨10.1016/j.tcs.2010.08.018⟩. ⟨hal-00469841v2⟩