Re: ** says: Definition: sum{i in N} i = 0

In article <1183020275.320012.107920@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
WM <mueckenh@xxxxxxxxxxxxxxxxx> wrote:

On 28 Jun., 08:02, Virgil <vir...@xxxxxxxxxxx> wrote:
In article <1183009493.535511.143...@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,


That means
P/K = lim_{x --> oo} (2^]x[) / (2^[x+1] - 1) > 2
or set theory is selfcontradictory.

It only means that, as usual, WM has the wrong end of the stick.

WM is claiming that a rule that only applies to some paths because they
have leaf nodes must apply to paths not having leaf nodes also.

First: I consider every path, including such which do not end, by ]x[.
Second: All paths, except some divine ones, consist of nodes.
Third: My consideration does not end, is not estricted to leaves, but
concerns the limit x --> oo.

Regards, WM

Does WM deny that for every finite binary tree in which all paths are of
equal length that there is a different path for every subset of the set
of all non-terminal levels defined by having for every set of levels a
path branching left from those levels and right from every other level?

I.e., Does WM deny that for such finite trees there is a bijection
between the power set of the set of non-terminal levels and the set of
paths?

And why does WM argue that such a correspondence should suddenly fail
when the tree becomes infinite, when it clearly does not.
.

Relevant Pages

  • Re: Extracting class data from a jar
    ... followed by code generation. ... Any idea how I could extract the relevant data? ... Didn't describe what this tree represents. ... NodeComponent nodes can only be dropped on leaf nodes, with 1 exception, ...
    (comp.lang.java)
  • Re: infinity
    ... >>> if one were to consider an unending tree, each path through it would be ... >>> unending, so there would be some infinite number of branches, but there ... >>> would also be zero leaf nodes. ... >> root node corresponds to the digital point. ...
    (sci.math)
  • Re: Cantor and the binary tree
    ... > equivalent, but infinite or non-terminating paths have no leaf nodes, ... > 2) All nodes of the tree belong to a countable set. ... > nothing to do with the number of unending paths. ... > represented by a terminating binary fraction, ...
    (sci.math)
  • Re: Cantor and the binary tree
    ... An infinite tree means one in which *every* node branches and leads to ... they end in leaf nodes. ... > one node that represents the root path. ...
    (sci.math)
  • Re: ** says: Definition: sum{i in N} i = 0
    ... In the whole tree we can calculate two limit points, ... What is a path bunch in the infinite tree? ... As a matter of fact oo + oo is undefined e.g. in the one-point ...
    (sci.math)