Remoce todo

The Turing machine limit (halting problem) falls into the same class as Godel incompleteness.  Generally we cannot answer "yes" or "no" to the halting problem, meaning our knowledge set is incomplete.  If we modify our axioms and force completeness via the ability to answer any halting problem, there will be at least one question we answer both "yes" and "no" simultaneously, rendering our system inconsistent.