Provide a theoretical explanation of the Halting Problem as introduced by Alan Turing. Outline the proof by contradiction demonstrating why no general algorithm can decide whether an arbitrary program halts on a given input. Discuss the broader implications of this result for the foundations of mathematics and the existence of unsolvable problems.