This project emulates a Turing Machine. Enjoy! About the Turing Machine: The famed computer scientist and WW2 Bletchley Park code breaker Alan Turing published a paper on a theoretical computer that he called the a-machine (automatic machine). It was proven to be able to solve any computable algorithm, however complex and became the definition of computability - If something could emulate a turing machine, it could solve any computable problem. It works by using a read/write head which can understand symbols on an infinite tape. The head can also overwrite symbols on this tape. The tape is arranged into cells, each can contain one symbol. The computer can be in a single state from a finite set of possible states. The computer is programmed with an instruction set containing the current state, the current symbol, the new state, the new symbol and the direction in which to move (left or right by one cell). Using this system, anything can be computed! Wikipedia link: https://en.wikipedia.org/wiki/Turing_machine
Load function under construction! Change Log: --- 05/29/2020/ --- Shared! Load function doesn't do anything yet. Untested. Basic Variable displays.
