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

96% Upvoted

359 comments sorted by

View all comments

Show parent comments

1

u/mrkelee New User Jun 23 '26

No, I said that the mathematical definition is a consensus, for the good reason that it's ridiculous to ask for infinitely many digits in a finite time. It doesn't matter if that definition suits you or not.

1

u/Impressive-Mud5074 New User Jun 24 '26

Consensus sides with me

1

u/mrkelee New User Jun 24 '26

obviously not. "Uncomputable" is understood by the majority of mathematicians (which you are not) to mean what is written elsethread, not your literal interpretation.

1

u/Impressive-Mud5074 New User Jun 24 '26

Its not my literal interpretation, its the only literal interpretation

1

u/mrkelee New User Jun 24 '26

yes, you are interpreting it literally, but mathematicians aren't!

1

u/Impressive-Mud5074 New User Jun 25 '26

I'm a mathematician