Advanced
Prove the Halting Problem
Construct a proof by contradiction demonstrating the undecidability of the Halting Problem.
📝 プロンプトの内容
Assume a hypothetical Turing machine H exists that can decide if any other machine halts on a given input. Construct a machine D that does the opposite of H when H is fed its own description. Explain the contradiction that arises when D runs on itself.