Re: infinity



In article <MPG.1d88e1864a974a3b98a204@xxxxxxxxxxxxxxxxxxxxxxxxx>,
Tony Orlow (aeo6) <aeo6@xxxxxxxxxxx> wrote:

> Randy Poe said:

> > Empty words, no reasoning. Let's look at the actual expression you
> > try to write.

> Empty words? All lengths are finite, and for any finite length the
> language up to that length is finite, so the language is finite.

TO asserts that the number of words of finite length is finite.

Since any concatenation of any set of words creates a word not in the
original set, the TO's claim fails. There cannot be a finite set
containing all possible finite words, since such a set cannnot contain
any concatenation of all the words in it.

Since such concatenations of infinitely many words do not create words
of finit lengths, it appearsas if any set of ALL words of finite length
must not be a finite set.


> The statement applies to ALL finite strings. If ALL strings are
> finite, then there are NO infinite lengths, and the sum can NEVER be
> infinite.

Show us any finite set of finite words that contains the finite word
formed by any concatenation of all its members.

TO can't show us any? Surprise, surprise!

Come back again when you can do this impossibility, TO, but until then
shut up about claiming things that are impossible.
.



Relevant Pages

  • Re: infinity
    ... >>> Empty words, no reasoning. ... > any concatenation of all the words in it. ... >> finite, then there are NO infinite lengths, and the sum can NEVER be ... this contradiction derives from the contradiction of the largest finite, ...
    (sci.math)
  • Re: Calculus XOR Probability
    ... The fact that standard mathematics cannot keep up, ... conclusion is drawn about something infinite. ... some sense) sum of lengths, and using finite sets of equiprobable elements ... but about the limit of finite sums of lengths. ...
    (sci.math)
  • Re: Orlow cardinality question
    ... A set of integers having infinite cardinality ... >> Given a set of symbols with size S, we can produce a set of all strings using ... When you deal with computers, the digits are all there, zeroes and all. ... > lengths of the number of numbers of each length. ...
    (sci.math)
  • Re: Orlow cardinality question
    ... A set of integers having infinite cardinality ... > Given a set of symbols with size S, we can produce a set of all strings using ... Since pofnats are written with *finite* strings of digits (not starting ... lengths of the number of numbers of each length. ...
    (sci.math)
  • Re: infinity
    ... > all lengths are finite, then none are infinite, and the language cannot be ... One does not need any infinite lengths to have the set of lengths ... In TO's set theory black is white and white is black, ...
    (sci.math)