C++ Turing Machine
A turing machine implemented in C++ with the function of squaring N number of characters.
A simple Turing Machine defined as a Deterministic Finite Automota (DFA). This implementation takes in a string of N number of a characters and returns N2 number of a’s. The full project can be found on my github here. The alphabet and transition states can be updated for any algorithm you can think of, and it will be performed by the DFA. Because this is Turing complete, it could theoretically be used to simulate anything a normal computer can, although that would be really time consuming and I wouldn’t recommend it. That would be like trying to travel around the world only by swimming.