Describe the Halting Problem as formulated by Alan Turing. Construct a detailed proof by contradiction demonstrating that a general algorithm to determine whether an arbitrary program halts or runs forever cannot exist. Discuss the theoretical implications for the limits of mathematical knowledge.