Provide a rigorous theoretical explanation of the Halting Problem, as introduced by Alan Turing. Construct a proof outline demonstrating why it is impossible to write a general algorithm that determines, for any arbitrary program-input pair, whether the program will finish running or continue to run forever. Discuss the broader philosophical and practical implications of this limitation for formal systems and the predictability of software behavior.