Intrinsic universality of a 1-dimensional reversible cellular automaton

This paper deals with simulation and reversibility in the context of Cellular Automata (CA). We recall the definitions of CA and of the Block (BCA) and Partitioned (PCA) subclasses. We note that PCA simulate CA. A simulation of reversible CA (R-CA) with reversible PCA is built contradicting the intuition of known undecidability results. We build a 1-R-CA which is intrinsic universal, i.e., able to simulate any 1-R-CA.