Provide a theoretical proof sketch of the Halting Problem. Explain why there cannot exist a general algorithm that, given a description of an arbitrary computer program and an input, decides whether the program finishes running or continues to run forever. Discuss the broader implications of undecidability for computer science and the limits of what can be calculated.