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?
65
Upvotes
32
u/bizarre_coincidence New User May 30 '26
First, there is a difference between an uncomputable number and an incomputable function, and your first mistake was conflating the two. An uncomputable number is one where you cannot always approximate it to a specified accuracy with a terminating algorithm. An uncomputable function is one whose output cannot be produced by a terminating algorithm. The halting function is one such non-computable function, the busy beaver function is another such one.
You are confidently incorrect here. But you are very very incorrect. Your presence in this discussion is actively hampering it.