```Date: Dec 13, 2012 2:10 AM
Author: mueckenh@rz.fh-augsburg.de
Subject: Re: On the infinite binary Tree

On 12 Dez., 22:10, Virgil <vir...@ligriv.com> wrote:> > The issue is this:> > Every partial tree from level 0 to level n has> > -1 + 2^(n+1) nodes.> > The number of all finite paths is the same, because every finite path> > ends at some node.> > The number of all path traversing the complete partial tree and> > branching after that in two paths is> > 2^(n+1).> > In the limit we have> > numbers of paths traversing the complete tree (and after that> > branching in two paths) divided by number of nodes of the complete> > tree = 1.>> How does a path which has finished traversing the complete tree have any> further branching possible?If that is impossible, we have only half of the number.>> It is a stupid self-contradiction to claim that a process which has been> completed will then continue beyond its completion.Yes. it is stupid to claim that after *all* nodes are covered byfinite paths there are yet more infinite paths possible.Regards, WM
```