A simple language for implementing classic symbols-and-tape Turing Machines. Still a work in progress.
Running the 4-state 2-symbol Busy Beaver:
- Running a program by referencing a file from the command line
- A less inelegant method for visualising a run
- Possibly storing both rules and initial configurations in the same file