|
|
Re: Endorsement of Wolfgang Mueckenheim from a serious mathematician
Posted:
Jan 31, 2013 11:51 AM
|
|
On 31 Jan., 15:27, forbisga...@gmail.com wrote:
> On Wednesday, January 30, 2013 1:03:49 PM UTC-8, WM wrote:
> > Now I
> > construct the complete infinite Binary Tree by means of countably many
> > paths,
>
> You have never done such a thing.
Of course I have. I construct one infinite path through each node.
That means there are uncountably many paths and every combination of
nodes residing on levels L_n with finite index n is constructed.
>
> > such that every node and every possible combination of nodes is
> > covered by at least one path (in fact by infinitely many).
>
> Yes, infinitely many paths. Uncountably infinite many paths.
That is wrong. I need only countably many paths.
> You have never given any means to count them all. You just
> assert you have done so.
Here is a means that everybody with a minimum of intelligence can
understand.
I construct a finite path to every node and then append that path by
an infinite tail, for instance, 010101...
But I don't tell you what tail I used, because this tail is completely
meaningless. It will only prevent that you can argue the path of 1/3
or the path of 1/7 is not in the tree.
Regards, WM
|
|
