Date: Mar 22, 2013 3:36 AM
Author: Virgil
Subject: Re: Matheology � 224

In article 
<dc92c9ae-3d15-41ac-99ce-e5ab8b8a5e5c@l16g2000yqe.googlegroups.com>,
WM <mueckenh@rz.fh-augsburg.de> wrote:

> On 21 Mrz., 20:35, fom <fomJ...@nyms.net> wrote:
> > On 3/21/2013 10:11 AM, WM wrote:
> >
> >
> >

> > > Induction does not need time.
> >
> > In
> >
> > news://news.giganews.com:119/f23c81fd-2463-4d3f-8df4-04799a493...@z4g2000vbz
> > .googlegroups.com
> >
> > WM wrote:
> >
> > ================
> > Everything that is in the list
> > 1
> > 1, 2
> > 1, 2, 3
> > ...
> > 1, 2, 3, ..., n
> > is in the last line.


If that list contains more than one line, then it must contain more than
one copy of "1", which that last line does not then do.

WM has claimed to bijectively map the set of binary sequences , B to the
set of reals |R and then that image in the reals to the set of paths, P,
of a of a Complete Infinite Binary Tree.

Which is perfectly possible for some types of mappings.

But WM claims that he can do it with bijective linear mappings, which,
for several reasons, neither he nor anyone else can do.
--