Re: Cantor and the binary tree
- From: "*** T. Winter" <***.Winter@xxxxxx>
- Date: Thu, 26 May 2005 00:09:48 GMT
In article <MPG.1cfe8ee5a9650528989d2a@xxxxxxxxxxxxxxxxxxxxxxxxx> Tony Orlow (aeo6) <aeo6@xxxxxxxxxxx> writes:
....
> So what? As you pointed out, when you add a node, you add a node, a branch,
> and a path. Actually, you need to add two nodes for each path, but that is
> irrelevant. They are finitely proportional, so if one is finite, the other
> is, and if one is infinite, so is the other. Infinite trees have infinite
> nodes and paths. Finite tree only have finite numbers of nodes and paths.
> It's a fact.
How do you jump from finite nodes to infinite nodes? An infinite path
never ends.
--
*** t. winter, cwi, kruislaan 413, 1098 sj amsterdam, nederland, +31205924131
home: bovenover 215, 1025 jn amsterdam, nederland; http://www.cwi.nl/~***/
.
- Follow-Ups:
- Re: Cantor and the binary tree
- From: mueckenh
- Re: Cantor and the binary tree
- From: aeo6
- Re: Cantor and the binary tree
- References:
- Re: Cantor and the binary tree
- From: mueckenh
- Re: Cantor and the binary tree
- From: Virgil
- Re: Cantor and the binary tree
- From: aeo6
- Re: Cantor and the binary tree
- Prev by Date: Re: What is a determinant?
- Next by Date: Re: Smoothest function passing through n points
- Previous by thread: Re: Cantor and the binary tree
- Next by thread: Re: Cantor and the binary tree
- Index(es):