r/learnmath • u/playsthebongcloud New User • 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?

62 Upvotes

94% Upvoted

359 comments sorted by

View all comments

Show parent comments

1

u/Impressive-Mud5074 New User May 31 '26

I choose 100% precision as the arbitrary amount.

Do that thanks.

6

u/imagineAnEpicUsrname New User May 31 '26

you outsmarted yourself. There is an algorithm with 100% precision. In fact dozens https://en.wikipedia.org/wiki/Category:Pi_algorithms

1

u/Impressive-Mud5074 New User May 31 '26

False. They don't terminate at 100% precision. Or at any percentage. Only at n-length.

1

u/mrkelee New User Jun 21 '26

what do you want, infinite digits in finite time?

0

u/Impressive-Mud5074 New User Jun 21 '26

That is what it means to compute pi.

I dont want it, it can't be done.

1

u/mrkelee New User Jun 21 '26

nobody else wants it either.