Earlier quoted context omitted.
The proof of the reals being uncountable depends on the idea that one can build a number that depends on being able to make an infinite number of choices, each of which depends on the absolute truth or falseness of a statement. But what happens if we open it up to have statements be true, false, or currently unknown? That is we develop a system of mathematics that could be in principle done inside of a Turing machine…
Mathematician here. If you mean to say that you cannot constructively prove "the real numbers are not countable", then you're wrong. As a rule of thumb, you can usually prove negative statements constructively as you would prove them classically. A constructivist would probably state the result more positive (and stronger, constructively): To every countable set M of real numbers, there is a real number not contained…
I have a similar (and I believe to be equivalent) problems with infinitesimal as well. How does arbitrarily small but non-zero become infinitesimal? Since I have problem with infinitesimal, I find the differentiation of real numbers and rational numbers equally non-sensical.
So mathematician, take a pause, could you explain what is countable infinity? Since you never can finish counting (all the natural numbers), how does it make the set countable? What do we mean exactly by countable here?
Wikipedia refers to the idea of one-to-one correspondence. But since you can never exhaust the correspondence, what do we mean by one-to-one? Give me any unique real, I'll give you a unique natural number, and we can go on forever, so how does that not count as one-to-one correspondence?
Unlike mathematicians, physicists are fine with unresolved :)
PS: I guess countable can be defined as there is a definite way of ordering the set, which is true for natural numbers but questionable for real numbers. I still don't see how the ordering connects to the size of infinity and one to one correspondence. Even for the set of real numbers, I can have an algorithm continuously generate random numbers (discarding re-occurring ones so it will be a unique sequence) and prove there is an order of the set (non-exhaustively defined, same as the set of natural number). The ordering may not be describable though. But non-describable ordering is still an ordering, right? Just as a real number that cannot be exhaustively described is still a number. I don't have to describe it, I can hand-wave it just as the way mathematicians hand-waved the infinity.