Sciweavers

Share
TCS
2011

Four states are enough!

8 years 1 months ago
Four states are enough!
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. Key words: Cellular automata, intrinsic universality, bulking, particles and collisions
Nicolas Ollinger, Gaétan Richard
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TCS
Authors Nicolas Ollinger, Gaétan Richard
Comments (0)
books