How Common Can Be Universality for Cellular Automata?

Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellular automata are almost all intrinsically universal. We show however that intrinsic universality is undecidable for captive cellular automata. Finally, we show that almost all cellular automata have no non-trivial sub-automaton.

• Type: Conference
• Year: 2005
• Where: STACS
• Authors: Guillaume Theyssier
• Keywords: Captive Cellular Automata, Cellular Automata, STACS 2005, Theoretical Computer Science, Universal Cellular Automata