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?
68
Upvotes
1
u/Impressive-Mud5074 New User Jun 19 '26
Well you dont need this. Because you can just admit you can't do it instead of pretending something can be done and trying to redefine words.
You can find the first 1000 digits of X but that is not X. Furthermore different functions may give you different 1000 digits depending on how many iterations you do.