a compiler from Turing Machines to VISL CG-3 code
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.
src/Data Finished CGTM. May 14, 2017
test Removed generated code. May 14, 2017
.gitignore Initial commit May 13, 2017
.travis.yml Added Travis CI support. May 14, 2017
LICENSE First commit. May 13, 2017
README.md Create README.md Jun 15, 2017
cgtm.cabal updated cabal Oct 8, 2018


CG Turing Machines

Build Status

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.

[1]: More specifically, the subset which only uses a single SECTION, ADDCOHORT and 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.

[2]: 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.