Universalities in Cellular Automata - Archive ouverte HAL Access content directly
Book Sections Year : 2012

Universalities in Cellular Automata


This chapter is dedicated to computational universalities in cellular automata, essentially Turing universality, the ability to compute any recursive function, and intrinsic universality, the ability to simulate any other cellular automaton. Constructions of Boolean circuits simulation in the two-dimensional case are explained in detail to achieve both kinds of universality. A detailed chronology of seminal papers is given, followed by a brief discussion of the formalization of universalities. The more difficult one-dimensional case is then discussed. Seminal universal cellular automata and encoding techniques are presented in both dimensions.


Other [cs.OH]
No file

Dates and versions

hal-00980362 , version 1 (17-04-2014)



Nicolas Ollinger. Universalities in Cellular Automata. Grzegorz Rozenberg and Thomas Bäck and Joost N. Kok. Handbook of Natural Computing, Springer, pp.189-229, 2012, 978-3-540-92909-3. ⟨10.1007/978-3-540-92910-9_6⟩. ⟨hal-00980362⟩
62 View
0 Download



Gmail Facebook X LinkedIn More