Simulate a Turing Machine encoding.
Turing Thesis: If a problem can be solved algorithmically, it can be represented by some Turing Machine.
From the Turing Thesis, a Decidable problem will either halt and accept or halt and reject.
From the Turing Thesis, and Undecidable problem will run indefinitely.
See Program.cs for an example of usage