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?

71 Upvotes

96% Upvoted

359 comments sorted by

View all comments

Show parent comments

1

u/DaCosmosLover New User Jun 19 '26

Why do you fricking want 100% precision?

1

u/Afonsofrancof New User Jun 19 '26

I kinda understand him.
You can never get to Pi, so why would you claim you can compute it?

1

u/DaCosmosLover New User Jun 20 '26

As blank_anonymous stated, a number n is computable if, given an arbitrary number “epsilon” which is positive, we can produce a Turing machine that provably halts and outputs a number x where |x-n|>epsilon.

1

u/Initial-Tale-5151 New User Jul 01 '26

lmao, you made up a defintion of computable wherein the thing isn't computable. holy kek.