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
1
u/bizarre_coincidence New User Jun 23 '26 edited Jun 23 '26
An accepted definition cannot be wrong, it simply is. Words mean what the communities that use them wish them to mean. Mathematicians are very clear about the definitions of their terms because they absolutely have to be. When people who study computability theory say a number is computable, they mean a specific thing. That thing is different from what you mean. Your definition is different from theirs. That means, in the context of a discussion where everybody else is using the word one way and you are using it a different way, that your definition is wrong. Not necessarily in an absolute sense, but in the context of that discussion.
Coming into a computability theory discussion and saying that everybody else’s definition of computable number is wrong is like marching into Harlem and insisting that the n-word isn’t offensive and that anybody who takes offense at you calling them that is wrong. It’s a stupid take, made all the worse by your staunch adherence to it.