logoalt Hacker News

IsTomyesterday at 6:27 PM0 repliesview on HN

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.