On 12 Jun., 18:31, William Hughes <wpihug...@hotmail.com> wrote: > On Jun 12, 12:13 pm, WM <mueck...@rz.fh-augsburg.de> wrote: > > > > > > > On 12 Jun., 17:42, William Hughes <wpihug...@hotmail.com> wrote: > > > > On Jun 12, 10:36 am, WM <mueck...@rz.fh-augsburg.de> wrote: > > > > > On 12 Jun., 12:23, William Hughes <wpihug...@hotmail.com> wrote: > > > > > > On Jun 12, 3:14 am, WM <mueck...@rz.fh-augsburg.de> wrote: > > > > > > > On 11 Jun., 23:06, William Hughes <wpihug...@hotmail.com> wrote: > > > > > > > > On Jun 11, 4:38 pm, WM <mueck...@rz.fh-augsburg.de> wrote: > > > > > > > > > On 11 Jun., 21:33, William Hughes <wpihug...@hotmail.com> wrote: > > Your claim is that "no possibility exists to construct or to > distinguish by one or many or infinitely many nodes > of the tree another path."
So it is. Proof: Let me construct a tree. I will not tell you what kind of paths I use. For instance I could use terminating paths or paths with tails 111... or paths with tails pi-3 or paths with tails e-2 or a mixture of many kinds of paths. I will present you the tree when it is ready. Would you bet to be able to distinuish your path from the set that I have used?
> > > the tree contains every element of > > > P and the path p. Since they have not changed form it > > > is still possible to distinguish p from every element of P. > > > Sorry, that is impossible. > > Note that you have agreed > > the binary tree contains a path > p that can be distinguished from > every element of P. > > this directly contradicts your claim that > > no possibility exists to construct or to > distinguish by one or many or infinitely many nodes > of the tree another path.
So let us play the game. Choose a path and try to distinguish it from the set of paths that completely cover my tree. > > > Every node of path p and every set of nodes > > of path p is covered by one or more paths of P. > > Indeed, one *or more* paths of P. > The set of nodes in path p is > not covered by one path in P.
Ok. Let us start. I often get spam mails offering some millions of dollars. I will risk one of them, say 10 million dollars on the claim that you will not be able to distinguish your path from the set of paths that I have used for construction. What about your stakes?
