Four states are enough! - GREYC amacc Access content directly
Journal Articles Theoretical Computer Science Year : 2011

Four states are enough!

Abstract

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.
Fichier principal
Vignette du fichier
4ae.pdf (643.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00469841 , version 1 (02-04-2010)
hal-00469841 , version 2 (17-08-2010)

Identifiers

Cite

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⟩
262 View
211 Download

Altmetric

Share

Gmail Facebook X LinkedIn More