A Note on Nondeterministic Reversible Computations

We show how reversible grammars can simulate any Turing machine. This result is applied in molecular computation. It turns out that splicing systems with only 3 test tubes and a set of reversible splicing rules-that thus operate near thermodynamical equilibrium- can simulate any Turing machine and are therefore unpredictable