Present a theoretical proof, typically using a diagonalization argument or proof by contradiction, demonstrating that the Halting Problem is undecidable. Explain the consequences of this result for the limits of what can be algorithmically determined about program behavior.