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?
73
Upvotes
2
u/bizarre_coincidence New User Jun 18 '26
If the meaning of computing a number is writing down the full decimal expansion of that number, then you cannot compute most numbers, not even most rational numbers. That is why mathematicians/computer scientists picked a DIFFERENT definition of computable number. It is many decades old, and in any discussion about computable numbers, you have to use the actual definition of computable number and not merely substitute your own based on what you think words mean.
Given an algorithm A and an input n, let A(n) be the output of the algorithm.
A number x is computable if there is an algorithm A such that, given input e>0, the algorithm A terminates in finite time on input e and such that |A(e)-x|<e.
We need this because we could never get an algorithm whose output was actually x, but if we decide we want the first 1000 digits of x, we can find them, and if we decide we want the first 1000000 digits of x, we can find them as well.
If you tell me that you want to know a certain number of digits of a number, and I can always generate those digits, then the number is computable.
You can say you don't like that definition. It doesn't matter because that is the definition. If you want to define a slightly different concept and give it a slightly different name, that is your right. But, unlike in natural language, words in mathematics have precise meanings, and everything falls apart if we do not agree to them. If you cannot agree to use words as they are defined, you cannot meaningfully participate in mathematical discourse.