Turing Machines implementation

Your task is to solve all 10 exercises of this contest: [login to view URL] The contest is already over, but I'm interested in how possible solutions for it look like. You have to use this Turing machine simulator for it: [login to view URL] You can compile it with Rust from scratch, or use the pre-compiled release for it, see the release 0.1 for it, for Linux, Windows and Mac. Here is the first exercise solved: { "initial": "H", "blank": "#", "tape": "H", "transitions": [ ["H", "H", "H", "R", "T"], ["H", "T", "T", "R", "H"], ["T", "#", "T", "L", "HALT"], ["H", "#", "H", "L", "HALT"] ] } If you run it from the command line, you can see the output as shown in the attached screenshot. The initial tape is "H" and the final tape is "HT". If you change the "tape" in the json file to "T", then the final tape will be "TH", as required by the exercise. Delivery will be 9 json files for the remaining 9 exercises. I'll test it with different input tape configurations and it must produce the required final tape as described in the exercises. There is also a web version of the Turing machine simulator here, which runs without installing anything: [login to view URL] Attached is another screenshot which shows the first exercise. But it might not work for bigger machines depending on the number of steps, you have to use the command line program in this case. Since the original contest was conducted in only 3 hours, this should be a fairly simple project and easy to finish.

Project ID: 39233450