Four states are enough!
Résumé
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.
Domaines
Autre [cs.OH]Origine | Fichiers produits par l'(les) auteur(s) |
---|