https://github.com/wenkokke/cgtm

a compiler from Turing Machines to VISL CG-3 code
https://github.com/wenkokke/cgtm

haskell turing-completeness turing-machine-simulator vislcg3

Last synced: 18 days ago
JSON representation

a compiler from Turing Machines to VISL CG-3 code

• Host: GitHub
• URL: https://github.com/wenkokke/cgtm
• Owner: wenkokke
• License: bsd-3-clause
• Created: 2017-05-13T14:33:40.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2018-10-08T22:35:57.000Z (over 7 years ago)
• Last Synced: 2025-02-25T07:15:31.951Z (over 1 year ago)
• Topics: haskell, turing-completeness, turing-machine-simulator, vislcg3
• Language: Haskell
• Homepage: https://wenkokke.github.io/2017/visl-cg-3-is-the-new-assembler/
• Size: 69.3 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# CG Turing Machines

[![Build Status](https://travis-ci.org/wenkokke/cgtm.svg?branch=master)](https://travis-ci.org/wenkokke/cgtm)

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](https://wenkokke.github.io/2017/visl-cg-3-is-the-new-assembler/)*.

---

[]: 

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 `""` 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.