To prove that a new language is Turing-complete the authors need to show that it can simulate any other (already known) Turing-complete language.
I wonder what Turing-complete language is the simplest to simulate? Bitwise Cyclic Tag looks very easy. Are there better candidates?
