Comment by IsTom
8 days ago
Even more concretely, the halting problem for turing machines with halting problem oracle would be undecidable for them. And if you could solve that you won't believe what problem would be undecidable. It's turtles all the way up.
No comments yet
Contribute on Hacker News ↗