On Jul 19, 11:00 am, MoeBlee <modem...@gmail.com> wrote: > On Jul 19, 3:44 am, WM <mueck...@rz.fh-augsburg.de> wrote:
> > P_a is a path, i.e. a funtion from N into {0, 1}. > > Fine, but WM needs to give a formulation of WHICH path P_a is for any > given a in the domain of P. Otherwise, P remains undefined by him.
Actually, not fine. Because WM has changed his formulation.
Now we he says each P_a is a function from N into {0 1}.
But earlier he said each P_a is a function from N into {0 1}^N.
> The Binary Tree is a set of functions P_a, from N to {0,1}^N, > with each value P_a_k, a in second number class, k in N, being a > function from N to {0,1}
There, each P_a is a function from N into {0 1}^N, and each P_a_k is a function from N into {0 1}.
Now he's changed to P_a itself is a function from N into {0 1}.
But he immediately went on to say:
> For each k in N, and each a in second number class, each P_a_k is a > member of {0,1}
So each P_a_k is a member of {0 1}, but he had just said that each P_a_k is a function from N into {0 1}.
