Explain the theoretical significance of the Halting Problem as proven by Alan Turing. Discuss why it is impossible to write a general algorithm that can determine for any arbitrary program-input pair whether the program will finish running or continue forever. Furthermore, analyze the practical implications this has on the field of static code analysis and automated bug checking.