The original Halting Problem: There exists a decider H(,) such that for all program p and input x, H(p,x) decides whether p halts on x.
The reduced Halting Problem: For all program p and input x, there exists a decider H(,) such that H(p,x) decides whether p halts on x.
Is the reduced problem decidable?
No comments:
Post a Comment