Explain the Halting Problem as formulated by Alan Turing. Provide a proof sketch demonstrating why it is undecidable. Discuss the theoretical implications of this problem for the limits of algorithmic computation and its impact on the foundations of computer science.