Provide a theoretical explanation of Alan Turing's Halting Problem. Outline the proof by contradiction demonstrating that it is impossible to write a general algorithm that determines whether any given arbitrary program will finish running or continue forever. Discuss the implications of this limit for Artificial General Intelligence.