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

• Type: Journal
• Year: 2011
• Where: TCS
• Authors: Nicolas Ollinger, Gaétan Richard
• Keywords: Intrinsic Universality, TCS 2011, Theoretical Computer Science, Universal Cellular Automaton, first Neighbors Neighborhood