Re: how

Le 22/04/2024 à 20:34, Moebius a écrit :

On the other hand, "in principle" it might be "possible" - if you believe in/accept supertasks.

When every count is done in half the remaining time, it would be possible, but only if all numbers were accessible. The impossibility proves dark numbers.

 See: https://en.wikipedia.org/wiki/Supertask
 Note that set theory does not rely on supertasks. That's why we use a set theoretic definition for the notion /countable set/. See above.

The mapping is nothing else but counting. f(x) defines the position where an argument has to be inserted.

 Hint: On this basis we can prove for example (a) that the set of rational numbers (Q) is a countable set

only if potential infinity is asumed.

and (b) that the set of real numbers (R) is an uncountable set.

Only if actual infinity of definable numbers is erroneously assumed.
Regards, WM