CG Turing Machines
This is a small library which generates VISL CG-3 code from Turing machine specifications, proving that VISL CG-31 is Turing-complete2. This development is accompanied by a blog post, VISL CG-3 is the new assembler.
More specifically, the subset which only uses a single
REMCOHORT. While it also uses the
ADD command, this could be simulated by adding
"<Tag>" cohorts. However, for reasons of clarity, I've not done this.
: The other direction—the fact that VISL CG-3 grammars can be run on a Turing machine—is probably adequately proven by the VISL CG-3 implementation.