Provide a theoretical proof sketch for the undecidability of the Halting Problem. Use the technique of diagonalization or a self-reference contradiction to demonstrate why no general algorithm can determine if an arbitrary program halts.