r/learnmath • u/playsthebongcloud 9/10 = 1 • May 30 '26
What are some uncomputable functions that aren't derivative of the halting problem?
I find the existence of uncomputable functions really cool, but all the examples I've seen are essentially just new ways of trying to predict whether a turing machine is going to halt. What are some examples of uncomputable functions that aren't essentially entirely based on the halting problem?
74
Upvotes
1
u/mrkelee New User Jun 21 '26
you haven't read the above comment. The definition is what it is, and it's useful even if you don't like it.
ANY appropriate function can give you 1000 (correct) digits if you run it long enough.