Define the Halting Problem as formulated by Alan Turing. Provide a clear, step-by-step proof of why it is undecidable to determine whether an arbitrary computer program will finish running or continue to run forever. Use a diagonalization argument or contradiction to illustrate the logic.