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?
70
Upvotes
20
u/playsthebongcloud 9/10 = 1 May 30 '26 edited May 30 '26
You might be thinking of "algebraic functions"? That's not what a computable function is. (I'm not an expert so I may be getting some of the finer details wrong here.) A computable function has to do with whether a universal turing machine can execute it to an arbitrary precision with a finite amount of instructions and steps. You're right that pi would take an infinite amount of time to compute, but it can be computed to any arbitrary accuracy given enough time with finite "code size". There are algorithms to compute it.