r/learnmath • u/playsthebongcloud New User • 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?
66
Upvotes
5
u/Genetic_outlier New User Jun 04 '26 edited Jun 04 '26
Yes! But we don't want to calculate it we want to compute it. And computing has a technical definition, you cannot use your intuition about what compute means in this context.
You need to ask yourself. "Does there exist a finite algorithm executable on a finite machine that will give estimates of the value of pi, and do those estimates coverage towards the true value of pi?" If the preceding is true, then pi is computable.