Provide a proof by contradiction demonstrating that the Halting Problem is undecidable. Construct the hypothetical machine H that decides if a program halts on a given input. Define a machine D that uses H and leads to a paradox when D is fed its own source code. Conclude by explaining what this implies for the limits of algorithmic computation.