Thank you! I was beginning to think I was the only one who believes this. So many people seem to mistake the map for the terrain.
Thank you! I was beginning to think I was the only one who believes this. So many people seem to mistake the map for the terrain.
I think Turing introduced "computable numbers" which are a lot like the reals, but countable. You can write a program that produces each. So it includes integers, rationals, polynomic irrationals, and lots of transcendentals. But the set any particular person (or computer) operates on over the course of their existence is not just countable, but finite and not very large. You have to have expressed a representation of each in it at least once. We can only express a small number of numbers over the course of a life. Computers can do more of them. You might claim all those that programs you wrote have expressed.
And, of course, the number has to have finite expression. Representing pi as a summation is finite. But presenting a numerical computation involving it has to be an approximation if it ever to finish.
Despite it being a non-starter from a pragmatic standpoint, we could for instance easily imagine a novel numeral type that encodes the set S = {a + b·π where a and b are integers} (we can encode integers quite easily and all we need to reposesent such a number in silico is to encode a and b). Using such a numeral type, we are able to do exact arithmetic if our operations are restricted to addition and subtraction (and if we are content with fractional representation of numbers as being considered "exact", we can also do division and multiplication although we would have to work within the larger set S' = { (a + b·π) / (c + d·π) where, a, b, c, and d are integers and c·d ≠ 0} rather than within S).
That was my point, thanks.