Basis for bypassing the Halting Problem ?

The Turing Machine has three behaviors
(1) Transition to a unique final state indicating that the target of its analysis will halt.
(2) Transition to a unique final state indicating that the target of its analysis will not halt.
(3) Transition to a unique final state indicating that one or more of the above two states has been modified in an attempt to produce the Halting Problem. This state may be dynamically generated such that it does not exist in its "Halting Problem" input. This state is to be taken as an alternative "will halt" state.
.

Relevant Pages