106 articles – 48 references  [version française]
HAL: hal-00469841, version 2

Detailed view  Export this paper
Available versions:
Four states are enough!
Nicolas Ollinger 1, Gaétan Richard 1, 2
(2010-04-02)

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.
1:  Laboratoire d'informatique Fondamentale de Marseille (LIF)
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I
2:  Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen (GREYC)
CNRS : UMR6072 – Université de Caen Basse-Normandie – Ecole Nationale Supérieure d'Ingénieurs de Caen
amacc
Computer Science/Other
Cellular automata – intrinsic universality – bulking – particles and collisions
Attached file list to this document: 
PDF
4ae.pdf(634.4 KB)