Provide a theoretical proof outline of the undecidability of the Halting Problem. Assume the existence of a hypothetical machine H that decides if any program halts on a given input, and construct a paradoxical machine D that uses H as a subroutine to generate a contradiction. Explain what this implies about the limits of algorithmic verification of text-based programs.