On 17 Dez., 22:47, Quaestor <quaes...@qqq.com> wrote:
> > Please prove your assertion by showing which path I did not produce. > > But prove it by knowing only all nodes of all paths. > > Until you give some explicit way of telling which paths you do produce, > ther is no way of telling which ones you miss.
I produce every path. There is no node in the complete binary tree that is not member of an infinitude of paths. > > > Information exceeding the infinite sequence of nodes of each path is > > not acceptable in mathematics. > > I do not accept your fiats on what is or is not acceptable in > mathematics,
In mathematics, numbers are defined by digits. Additional information is not part of mathematics. If you do not accept that, then there is no common basis for discussion.
My claim is: The set of numbers which can unambiguously be identified by digit sequences is countable. >
> > Which path do you see in the tree that has not that property? > > In my tree, none. But in there are sets of nodes satisfying my condition > of pathhood which do not occur in your tree.