How to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata

@article{Dubacq1995HowTS,
  title={How to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata},
  author={Jean-Christophe Dubacq},
  journal={Int. J. Found. Comput. Sci.},
  year={1995},
  volume={6},
  pages={395-402}
}
The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an… CONTINUE READING