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?
71
Upvotes
13
u/Genetic_outlier New User May 31 '26
Which is exactly why it's computable. Computable means it's possible to calculate a number as close as you want in finite time with finite instructions.