Re: Approaching the infinite binary tree

In article
<13f0c9d4-ab4c-4d36-9cf9-ccbdaea14087@xxxxxxxxxxxxxxxxxxxxxxxxxx>,
LudovicoVan <julio@xxxxxxxxxxxxx> wrote:

On 30 Sep, 09:17, Virgil <Vir...@xxxxxxxxx> wrote:
In article
<3f66ae14-1538-4410-83ab-70c6cc5a4...@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
 LudovicoVan <ju...@xxxxxxxxxxxxx> wrote:
On 30 Sep, 05:10, Virgil <Vir...@xxxxxxxxx> wrote:
In article
<6bf9ced4-d917-4874-8da2-997cf15b8...@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
 LudovicoVan <ju...@xxxxxxxxxxxxx> wrote:
On 29 Sep, 22:18, Virgil <Vir...@xxxxxxxxx> wrote:
In article <290920081547112928%ed...@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
 "G. A. Edgar" <ed...@xxxxxxxxxxxxxxxxxxxxxxxxxxx> wrote:

In article
<36da9a22-353b-4a59-b222-36c755be8...@xxxxxxxxxxxxxxxxxxxxxxxxxxxx
,
David R Tribble <da...@xxxxxxxxxxx> wrote:

Mariano Suarez-Alvarez
You seem to mean by this that you have a last level, the one
indexed by w.

LudovicoVan wrote:
I can drop the "informally": A tree with w levels! What is
the
problem
with that?

Nothing at all.

However, you have a huge problem if you are saying there
is a level that has index w.

It may make perfectly good sense, depending on your definition of
"tree".
 http://en.wikipedia.org/wiki/Tree_(set_theory)

Just one of the many problems this creates for you:
what is the index of the level immediately before level w?

Depending on your definition of "tree", it can happen that "level
immediately before" need not be defined.

Probably means something like an infinite complete binary tree as
defined inhttp://en.wikipedia.org/wiki/Binary_tree, in which case
each
node other than the root must have a parent node in the "level
immediately before" it.

That article is quite irrelevant to a mathematical discussion (and
what you furtherly remark is of course the usual nonsense).

That article IS a mathematical discussion.

And my  nonsense is considerably  more sensible than you inept attempts
at sense.

The only mention to infinite trees is here:

[quote]
An infinite complete binary tree is a tree with Aleph_0 levels, where
for each level d the number of existing nodes at level d is equal to
2^d. The cardinal number of the set of all nodes is Aleph_0. The
cardinal number of the set of all paths is 2^Aleph_0.
[/quote]

Anyway I am puzzled: The number of nodes is Aleph_0??

Yes, aleph_0 is the cardinality of the set of natural numbers, which  
means that the nodes can be counted.

Are you sure? One then could conclude that the set of paths must be
countable too, since it can be put in a bijection with a subset of the
nodes, namely the set of the leafs.

That "leaf" property holds nicely only for finite trees in which every
path ends in a leaf node, but in the complete infinite binary  tree none
of them have leaf nodes, just as endless strings of charactes do not
have last characters.

Your three card games are just pathetic.

No math from you ever.

You would not be able to understand anyway, any more that you understand
infinite complete binary trees.

Try doing a bit of research.

? An infinite complete binary tree is a tree with aleph_0 levels,
where for each level d the number of existing nodes at level d is equal
to 2^d. The cardinal number of the set of all nodes is aleph_0. The
cardinal number of the set of all paths is 2^ aleph_0.
http://en.wikipedia.org/wiki/Binary_tree
.

Relevant Pages

  • Re: Approaching the infinite binary tree
    ... An infinite complete binary tree is a tree with Aleph_0 levels, ... path ends in a leaf node, but in the complete infinite binary  tree none ... just as endless strings of charactes do not ... I'll surely go back to the books and the usual hard work. ...
    (sci.math)
  • Re: Approaching the infinite binary tree
    ... But there are infinite paths in the complete binary tree that do ... It is your dogma, not ours, that you are being bit by. ... and all of them can be bijected with N. The set of even naturals, ...
    (sci.math)
  • Re: An uncountable countable set
    ... Because one can biject the set of edges with the naturals and biject the ... members in any power set that in the set itself. ... represents what happens in an infinite tree. ... paths in the infinite binary tree and the power set of the set of paths, ...
    (sci.math)
  • Re: Cantor Confusion
    ... A potentially infinite quantity is always finite. ... representation has a finite index n. ... Note that also the union of all finite initial segments of N, {1, 2, 3, ... A finite binary tree is the infinite binary tree, ...
    (sci.math)
  • Re: An uncountable countable set
    ... Tony Orlow wrote: ... Every H-riffic corresponds to a node in an infinite, but countable, ... along a path in a binary tree. ... produce infinitely recursively-defined H-riffics from your existing ...
    (sci.math)