Describe the Halting Problem and provide a theoretical proof of its undecidability. Use the concept of a hypothetical machine that decides halting to derive a logical contradiction. Discuss the implications of this result for the limits of what can be computed.