🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.logic
Article #854

Re: A Guide for Cantor Cranks

#854
From: William Hughes
Date: Mon, 21 Mar 2011 15:21
142 lines
6621 bytes
On Mar 21, 11:06 am, Graham Cooper <grahamcoop...@gmail.com> wrote:
> On Mar 21, 10:41 pm, William Hughes <wpihug...@gmail.com> wrote:
>
>
>
>
>
>
>
>
>
> > On Mar 21, 9:11 am, Graham Cooper <grahamcoop...@gmail.com> wrote:
>
> > > On Mar 21, 9:30 pm, William Hughes <wpihug...@gmail.com> wrote:
>
> > > > On Mar 21, 8:19 am, Graham Cooper <grahamcoop...@gmail.com> wrote:
>
> > > > > On Mar 21, 9:09 pm, William Hughes <wpihug...@gmail.com> wrote:
>
> > > > > > On Mar 21, 4:09 am, Graham Cooper <grahamcoop...@gmail.com> wrote:
>
> > > > > > > On Mar 21, 4:54 pm, William Hughes <wpihug...@gmail.com> wrote:
>
> > > > > > > > On Mar 21, 3:33 am, Graham Cooper <grahamcoop...@gmail.com> wrote:
>
> > > > > > > > > On Mar 21, 2:30 pm, William Hughes <wpihug...@gmail.com> wrote:
>
> > > > > > > > > > > My point is you can't support your claim with 2 given diagonals.
>
> > > > > > > > > > My claim is that given a list of binary sequences I can find a
> > > > > > > > > > sequence
> > > > > > > > > > not on the list.
>
> > > > > > > > > > To support this claim I need only one diagonal.  When you gave me
> > > > > > > > > > two diagonals I chose one and supported the claim.
>
> > > > > > > > > > Your claim that you can get a generalized diagonal with any finite
> > > > > > > > > > prefix is true, but irrelevant.  You cannot set the generalized
> > > > > > > > > > diagonal to an arbitrary sequence.
> > > > > > > > > >                                      - William Hughes
>
> > > > > > > > > You haven't proven your sequence is not on the list in the 2 diagonal
> > > > > > > > > version.
>
> > > > > > > > > AD1 = 1110...
> > > > > > > > > AD2 = 0110...
>
> > > > > > > > > Can you prove EITHER real is missing from my (secret) list given only
> > > > > > > > > the above?
>
> > > > > > > > > IF YES, then by all means do so!
>
> > > > > > > > There is a sequence not on your secret list that starts
> > > > > > > > 1100.  Proof: the n'th digit means that sequence is not
> > > > > > > > the n'th line of the list.  There may be other sequences that
> > > > > > > > starts 1110 on your secret list.
> > > > > > > >                                  -William Hughes-
>
> > > > > > > Well that was concise!
>
> > > > > > > But it's invalid due to the pigeon hole principle.
>
> > > > > > > My similar claim to yours is: no matter what numbers I put into the
> > > > > > > pigeon holes, there are always more empty pigeon holes than filled
> > > > > > > pigeon holes.
>
> > > > > > The pigeon hole principle does not work
> > > > > > for infinite sets.
>
> > > > > >                  - William Hughes-
>
> > > > > I'm not slotting infinite sequences into infinite pigeon holes.
>
> > > > Correct.  As usual you are arguing about infinite sets
> > > > using concepts that only work for finite sets.
>
> > > > Recall
>
> > > >  The anti-diagonal is formed by taking the
> > > >  diagonal and changing every 0 to 1 and 1 to 0.
>
> > > > Any claim that the anti-diagonal does not exist is
> > > > silly.  Any claim that the anti-diagonal is equal to
> > > > a row of the list is silly.
>
> > > >                          - William Hughes-
>
> > <snip discussion based on properties of finite sets>
>
> > Please discuss directly why you cannot take the diagonal
> > and change ever 0 to 1 and every 1 to 0.
>
> >                            - William Hughes
>
> > PS.  An example of a list an an anti-diagonal
>
> > List formed by counting in binary (n'th row is binary
> > expression for n followed by an infinite string of 0's.
>
> > 0000...
> > 1000...
> > 10000...
> > 11000...
> > ...
>
> > Anti-diagonal is an infinite string of 1's
>
> Because it's a naive definition of a sequence that sometimes directly
> contradicts the definition of diagonal.

This contradiction can only happen with a list
containing every real number.

For L1 not containing every real number I can certainly
form the sequence

L(1,1), L(2,2), L(3,3) ...

and change every 0 to 1 and every 1 to 0.

Your claim is that the is a list L2 for which
I cannot do this.

                       - William Hughes
Technical Details
Message-ID: <32625bfd-e1d6-4ee6-b3a6-b26f77abc437@t19g2000prd.googlegroups.com>
Path: arc1-ca.pugleaf.net!g2news2.google.com!postnews.google.com!t19g2000prd.googlegroups.com!not-for-mail
References: <40e69d0c-eb77-4308-996e-c7dfc1a0ec1e@j13g2000pro.googlegroups.com> <2298d465-e708-4801-be12-12c714cd98dc@f36g2000pri.googlegroups.com> <2e445897-6fc0-488d-9ab5-fcd1c7dc703d@f30g2000yqa.googlegroups.com> <efc21f2f-acb7-475d-87ab-fbfa35208c4c@o15g2000prn.googlegroups.com> <9c851574-eb70-45c4-b6e3-9351a7679223@k30g2000yqb.googlegroups.com> <92a4e0aa-6497-4357-8a6b-ecc706fa10f5@d26g2000prn.googlegroups.com> <5d2c87a8-5926-4b27-a445-3bc3ab5c98d0@u3g2000vbe.googlegroups.com> <35760f05-df0e-4c29-85c0-08f98cf10a42@s18g2000prg.googlegroups.com> <521e5cfe-5269-4d9a-ab45-5e8cf597b2d1@y31g2000vbp.googlegroups.com> <bf846398-3b78-4464-9f54-f95dc5233128@k10g2000prh.googlegroups.com> <0a04118c-f5e5-4d09-ab5a-e8df3212dc71@i4g2000pro.googlegroups.com> <72a0e3f5-9728-4be9-8fdb-0b73e3d855c7@d12g2000prj.googlegroups.com>

Show Full Headers
Complete Article Headers
X-Google-Thread: f8362,bdbafb069b8118a7
X-Google-NewGroupId: yes
X-Google-Thread: fd648,af7892021029fe4a
X-Google-NewGroupId: yes
X-Google-Attributes: gided4ff1f581,giddb42311052,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII
Path: arc1-ca.pugleaf.net!g2news2.google.com!postnews.google.com!t19g2000prd.googlegroups.com!not-for-mail
From: William Hughes <wpihughes@gmail.com>
Newsgroups: sci.logic,sci.math,comp.theory,sci.physics,aus.science
Subject: Re: A Guide for Cantor Cranks
Date: Mon, 21 Mar 2011 08:21:11 -0700 (PDT)
Organization: http://groups.google.com
Lines: 144
Message-ID: <32625bfd-e1d6-4ee6-b3a6-b26f77abc437@t19g2000prd.googlegroups.com>
References: <40e69d0c-eb77-4308-996e-c7dfc1a0ec1e@j13g2000pro.googlegroups.com>
 <2298d465-e708-4801-be12-12c714cd98dc@f36g2000pri.googlegroups.com>
 <2e445897-6fc0-488d-9ab5-fcd1c7dc703d@f30g2000yqa.googlegroups.com>
 <efc21f2f-acb7-475d-87ab-fbfa35208c4c@o15g2000prn.googlegroups.com>
 <9c851574-eb70-45c4-b6e3-9351a7679223@k30g2000yqb.googlegroups.com>
 <92a4e0aa-6497-4357-8a6b-ecc706fa10f5@d26g2000prn.googlegroups.com>
 <5d2c87a8-5926-4b27-a445-3bc3ab5c98d0@u3g2000vbe.googlegroups.com>
 <35760f05-df0e-4c29-85c0-08f98cf10a42@s18g2000prg.googlegroups.com>
 <521e5cfe-5269-4d9a-ab45-5e8cf597b2d1@y31g2000vbp.googlegroups.com>
 <bf846398-3b78-4464-9f54-f95dc5233128@k10g2000prh.googlegroups.com>
 <0a04118c-f5e5-4d09-ab5a-e8df3212dc71@i4g2000pro.googlegroups.com> <72a0e3f5-9728-4be9-8fdb-0b73e3d855c7@d12g2000prj.googlegroups.com>
NNTP-Posting-Host: 142.167.66.248
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
X-Trace: posting.google.com 1300720872 8645 127.0.0.1 (21 Mar 2011 15:21:12 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Mon, 21 Mar 2011 15:21:12 +0000 (UTC)
Complaints-To: groups-abuse@google.com
Injection-Info: t19g2000prd.googlegroups.com; posting-host=142.167.66.248; posting-account=1lE9SQkAAADFrJsDv61dh1YXcJ_ahy5I
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 6.1; en-US)
 AppleWebKit/534.16 (KHTML, like Gecko) Chrome/10.0.648.151 Safari/534.16,gzip(gfe)