In article <00852fd6-5479-4b70-9233-67f85b6e5961@o20g2000vbh.googlegroups.com>, WM <mueckenh@rz.fh-augsburg.de> wrote:
> On 8 Jun., 00:15, Virgil <virg...@nowhere.com> wrote: > > > In a maximal infinite binary tree a path can have only one "end" > > and all paths have the same end: the root node. > > That is the beginning.
It is the front end, so that it is an end.
> If you dislike the name "end", then speak of X = "path without its > first n nodes".
I prefer to call what is left after removing the head of a path, its tail.
> There are infinitely many nodes mapped on every X,
And uncountably many X through every node.
> namely those which > belong to that X. The X exhaust the complete binary tree, because > there is no node that remains unmapped. The X of every real number > you wish, including 1/3, 1/sqrt(2), 1/pi and so on, is among all > paths constructed.
Not so, as sequential construction, a la WM, doesn't cut it. > > Regards, WM
