Cellular Automata and Discrete Complex Systems 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers

We construct a one-dimensional reversible cellular automaton that is computationally universal in a rather strong sense while being highly non-sensitive to initial conditions as a dynamical system. The cellular automaton has no sensitive subsystems. The construction is based on a simulation of a reversible Turing machine, where a bouncing signal activates the Turing machine to make single steps whenever the signal passes over the machine.