Provide a proof sketch for the undecidability of the Halting Problem using a diagonalization argument. Discuss the practical implications of this theoretical limit on software verification and artificial intelligence. Can any system be proven to be bug-free?