This is the project for my class (History of Science and Technology). I made a Turing Machine in Flash. Well, it's more like a deterministic finite automaton but that's besides the point. Here it is for you to play with:
I've pre-programmed an example program that parses the symbol tape (of 'a' and 'b' only) so that no two 'b's are together. The program has persistent storage on your system, automatically removes state tables if they have no states, and yeah. Is awesome.
Quick run through on how to use it: Create/load a table, Create/load an initial tape, and run the machine. You can easily make your own though.
Enjoy.
No comments:
Post a Comment