|
|
|
|
|
by nyrikki
691 days ago
|
|
A Turing machine as an infinite long tape, and even if it takes 10 times the time to the heat death of the universe x<y will halt. Finite time is not practical time. Given two Turing machines A and B approximating numbers a and b, where a ≠ b, you can use an epsilon to prove a > b, that is 'sufficient' for a proof. You are trying to convert that one sided, semi-decidable 'a>b' into a two sided a>b f
Id yes and a≤b is no. That is undecidable. Even if you change the ≤ into <, which does imply the exitance of b. It doesn't prove equality. You have to resort to tactics like normalization for that. Type theory is probably a good path to understand why. You seem to be coming from a set perspective and you will run into the limits of ZFC that way. |
|
> Finite time is not practical time.
Sorry for my daftness but if x and y are both a transcendental number, for example pi, then x and y have infinitely many digits so the Turing machine that determines whether x < y is true will not halt, even with an infinitely long tape, or will it? What am I misunderstanding?
If you could recommend a source that explains the basics of these arguments, I’d appreciate it.