Another stab at Cantor
- From: msadkins04@xxxxxxxxx
- Date: 18 Sep 2006 09:50:13 -0700
Let R be the set of all infinite binary strings which eventually settle
into a repeating digit or pattern of digits. Let L1 be a well-defined
ordering of R. Let D1 be the diagonal number obtained from L1 by the
application of Cantor's diagonal process. D1 is not a member of R.
Let L2 be the list obtained by putting D1 at the head of L1 (that is,
by adding one to the index number of each member of L1, and placing D1
in the first position of the newly indexed list). Let D2 be the
diagonal number obtained from L2 by the application of Cantor's
diagonal process. D2 is not a member of R, and is not D1. Let L3 be
the list obtained by putting D2 at the head of L2.
Let L_Omega be the list defined by the totality of all possible steps
of this procedure. There is no non-repeating infinite binary string
excluded by the procedure. L_Omega therefore contains all
non-repeating infinite binary strings, which is to say all irrationals.
Mark Adkins
msadkins04@xxxxxxxxx
.
- Follow-Ups:
- Re: Another stab at Cantor
- From: georgie
- Re: Another stab at Cantor
- From: Sean Holman
- Re: Another stab at Cantor
- From: David C . Ullrich
- Re: Another stab at Cantor
- From: The Ghost In The Machine
- Re: Another stab at Cantor
- From: Shmuel (Seymour J.) Metz
- Re: Another stab at Cantor
- From: fishfry
- Re: Another stab at Cantor
- From: William Hughes
- Re: Another stab at Cantor
- From: Virgil
- Re: Another stab at Cantor
- From: Arturo Magidin
- Re: Another stab at Cantor
- From: Arturo Magidin
- Re: Another stab at Cantor
- Prev by Date: Re: If it maybe possible?
- Next by Date: Re: Binary bit
- Previous by thread: Binary bit
- Next by thread: Re: Another stab at Cantor
- Index(es):
Relevant Pages
|
