Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour

07/06/2019

∙

by   Sergio J. Martinez, et al.

∙

0

∙

share

Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular automaton with a 2-linear time and display its spatial dynamics. Three particular Turing machines are converted in three universal one-dimensional cellular automata, they are: binary sum, rule 110 and a universal reversible Turing machine.