Prev: Incompleteness thru Venn Diagrams
Next: How Can ZFC/PA do much of Math - it Can't Even Prove PA is Consistent (EASY PROOF)
From: |-|ercules on 5 Jul 2010 19:29 "George Greene" <greeneg(a)email.unc.edu> wrote > On Jul 5, 8:36 am, "|-|ercules" <radgray...(a)yahoo.com> wrote: >> It's the 'covered sequences' within the infinite sequences >> that approaches infinity. > > Then you have to DEFINE COVERED, dumbass! > And IF all you want to do is COVER the sequences, > THE THE LIST OF FINITE prefixes WILL DO that! > YOU DON'T NEED even ONE infinitely long real, JUST TO COVER the > sequences! > The list of all finite sequences OBVIOUSLY COVERS all FINITE prefixes, > since > a finite sequence and a finite prefix ARE THE SAME THING!! No they're not, a finite sequence has a terminating suffix. There is a distinction between sampling the one object and considering multiple different objects. You saying YES THEY ARE a hundred times is like a musician arguing his lyrics were copied. But I've done enough on this topic this round, if I come up with some formal distinction then in the words of Arnold Schwarzenegger I'LL BE BACK! Herc
From: George Greene on 5 Jul 2010 21:00 On Jul 5, 7:29 pm, "|-|ercules" <radgray...(a)yahoo.com> wrote: > But I've done enough on this topic this round, if I come up with some formal distinction There IS NO *relevant* distinction. You can ALWAYS come up with "a distinction". You would just be masturbating as usual if you did.
From: George Greene on 5 Jul 2010 21:02 On Jul 5, 7:29 pm, "|-|ercules" <radgray...(a)yahoo.com> wrote: > But I've done enough on this topic this round, No, you haven't. You still haven't DEFINED what it means for a LIST to COVER a SEQUENCE (finite or otherwise -- if the list is infinite then it can also cover an infinite sequence). > if I come up with some formal distinction You DON'T NEED a distinction -- formal or otherwise -- between "finite prefix" and "finite sequence" BECAUSE THERE ISN'T ANY -- EVERY finite prefix IS a finite sequence and EVERY finite sequence IS a finite prefix. What you DO need is a formal DEFINITION of COVERED. If you would ever write one then you would see that you are getting the quantifiers switched around.
From: |-|ercules on 5 Jul 2010 22:07 "George Greene" <greeneg(a)email.unc.edu> wrote > On Jul 5, 7:29 pm, "|-|ercules" <radgray...(a)yahoo.com> wrote: >> "George Greene" <gree...(a)email.unc.edu> wrote >> >> > On Jul 5, 8:36 am, "|-|ercules" <radgray...(a)yahoo.com> wrote: >> >> It's the 'covered sequences' within the infinite sequences >> >> that approaches infinity. > > You still have to DEFINE COVERED, DUMBASS. You made a post last week using some word to mean what I mean, but I shan't bother looking for it. > And it DOES NOT "approach infinity". It just STAYS FINITE ALL the > time. Binary example 00000000... 01111111... 01011111... 01000000... 01010101... 00111111... 11111111... 11000000... 11011111... 10000000... 10111111... 11000000... The length of all (initial) possible digit sequences within the set is 3. So you are saying this length does not approach infinity as the length of the computable reals list approaches infinity? Herc
From: |-|ercules on 5 Jul 2010 22:17
"George Greene" <greeneg(a)email.unc.edu> wrote > On Jul 5, 7:29 pm, "|-|ercules" <radgray...(a)yahoo.com> wrote: >> But I've done enough on this topic this round, > > No, you haven't. You still haven't DEFINED what it means for a LIST > to COVER a SEQUENCE > (finite or otherwise -- if the list is infinite then it can also cover > an infinite sequence). > >> if I come up with some formal distinction > > You DON'T NEED a distinction -- formal or otherwise -- between "finite > prefix" and "finite sequence" > BECAUSE THERE ISN'T ANY -- EVERY finite prefix IS a finite sequence > and EVERY finite sequence > IS a finite prefix. That is a rubbish argument, every finite sequence is a (special type of) finite prefix. If you can't support your assertion, stop repeating it. Transfinite theory DEPENDS on the list of all finite sequences being synonymous with the list of all computable reals regarding possible digit permutations, yelling that it must be so doesn't help your sad case. Stop reverse engineering your theorems and do some maths. You can keep yelling <1 2 3> = < [1 2 3] 4 5 6..> if you think it helps. I hear you George, I hear you. Herc |