On 14 Jun., 14:01, William Hughes <wpihug...@hotmail.com> wrote:
> > Assuming infinite paths exist: > > The path p is in the tree > > The path p can be distinguished from > every element of P.
For every path p_n of P there is a digit such that p differs from p_n. But there is no digit of p that differs from every path p_n of P because, if p exists as binary representation, then p is the union of all p_n and as such cannot differ from the union. > > You refuse to agree to > > Assuming infinite paths exist: > > There is a path p in the tree that can > be distinguished from every element of P. > > Until you explain this, no other argument as > to why you refuse to accept this statment > will be considered.
It is obviously impossible to distinguish p from all paths p_n that are in the binary tree after construction has been completed.
If you don't believe me, then play the game. Minimum stake 10^6 dollars or (if you come from Europe) Euros or Pounds.