On 11 Jun., 13:00, William Hughes <wpihug...@hotmail.com> wrote:
> > Because paths cannot be distinguished without nodes. > > Proves nothing. We know that a countable > number of elements can distinguish an uncountable > number of subsets. A countable number of nodes can > distinguish an uncountable number of paths.
No that is provably wrong. All nodes are used up by a countable number of paths, e.g., all paths ending in a tail of zeros. Therefore no possibility exists to construct or to distinguish by one or many or infinitely many nodes of the tree another path. All combinations of nodes that are possible in the tree have already been occupied.
