On 2 Nov., 09:00, Virgil <vir...@ligriv.com> wrote:
> If there is a bijection between |N and the set of digit positions in a > string of digits then one has an actually infinite string
There is a bijection between |N and the not so actually complete string of all finite strings. >
> > (You see > > this easily when considering the fact, that the complete tree cannot > > be distinguished from a less complete tree by nodes). > > Actually not! There are 2^N paths in that tree,
Not in that not so completely infinite tree of all finite paths.
