Is the halting problem is really just the older Pinocchio paradox and Russell paradox?

1 Answer

Relevance
  • j153e
    Lv 7
    5 months ago

    Russell's paradox ~ = no universal set in ZFC. Predicting the universality of a program, if universality = infinite run time, is a problem of prediction. Turing proved there was no program to solve this problem of prediction. So there's more to the halting problem than knowing that there's no universal set in ZFC.

    • j153e
      Lv 7
      5 months agoReport

      Of course, an infinity of prime pairs differing by 70 million or less is not a universal set as Russell defines it, and the halting problem is also different from Yitang Zhang's proof.

Still have questions? Get answers by asking now.