Explain the theoretical proof behind the Halting Problem, demonstrating why it is impossible to write a general algorithm that can determine whether any arbitrary computer program will eventually halt or run forever. Discuss the significance of this undecidability on the limits of formal systems and mathematical knowledge.