Provide a detailed explanation of the Turing Halting Problem. Construct a theoretical argument demonstrating why it is impossible to write a general algorithm that determines whether any arbitrary program will halt or run forever, highlighting the concept of proof by contradiction.