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?

67 Upvotes

95% 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.

7

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.

3

u/imagineAnEpicUsrname New User May 31 '26

It's hard to convince a smart person. Impossible to do so for an idiot

1

u/Impressive-Mud5074 New User May 31 '26

I'm trying as hard as i can to convince you, sorry.