Turing Machine Interpreter
A Turing Machine is equivalent to every computer ever. If a Turing Machine can do it, any computing device can do it. But the problem is, Turing Machines are really simple, making them really hard to use. The best program I could write was one that added up two 2-bit numbers and then halted. I didn’t spend all that long on it, so I’m sure you could come up with something better. But download the file and see what you can do. A short tutorial is included inside.