On Jun 12, 4:36 pm, WM <mueck...@rz.fh-augsburg.de> wrote: > On 12 Jun., 21:40, William Hughes <wpihug...@hotmail.com> wrote: >
> > > <snip attempt to change P > > after p has been chosen> > > You should give up. There is no attempt to change P. There is a proof > that you cannot distinguish p from the set of paths P that has been > used to construct the tree. > > > Note that you have agreed > > > the binary tree contains a path > > p that can be distinguished from > > every element of P. > > If I have agreed, then I was in error.
OK. I will give you the list of things you agreed with. Point out where you made your error.
There is a subset of nodes that cannot be found in a single element of P.
A subset of nodes is distinguished from an element q of P if and only if it is not contained in q.
A subset of nodes is distinguished from every element of P if and only if it is not contained in a single element of P.
There is a subset of nodes which forms a path, call it p, that is not contained in a single element of P.
The path p is distinguished from every element of P.
