Four states are enough!

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

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166
2 GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen

This paper presents a 1D intrinsically universal cellular automata with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer from 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; bulking; particles and collisions

Domaines: Autre [cs.OH]

Nicolas Ollinger, Gaétan Richard. Four states are enough!. 2010. ⟨hal-00469841v1⟩