Provide a detailed theoretical proof of the undecidability of the Halting Problem using a diagonalization argument. Specifically, construct a hypothetical machine H that decides if a given program halts on a given input, and then demonstrate a contradiction by creating a program D that feeds its own source code to H. Discuss the broader implications of this result on the limits of algorithmic computation.