Re: Cantor's diagonal proof wrong?

From: Shmuel (Seymour J.) Metz (spamtrap_at_library.lspace.org.invalid)
Date: 01/10/05 

Date: Mon, 10 Jan 2005 18:13:00 -0500

In <1105366233.590206.159560@c13g2000cwb.googlegroups.com>, on
01/10/2005
   at 06:10 AM, mueckenh@rz.fh-augsburg.de said:

>What is "possible existence"? Can anybody read them or not? Of
>course, many different numbers do possibly exist. But simultaneous
>use can be made of less than 2^10^100 only. And no string with more
>than 2^10^100 digits can ever be set up, in a mind, in a computer or
>elsewhere.

Does the center of the Earth exist? I'm not aware of any way that you
can observe it, even in principle.

>But it cannot be excluded, that you books meanwhile are elsewhere or
>nowhere.

It cannot be excluded that the entire Universe is an hallucination,
and therefor no argument based on the observed behavior of the
Universe has a logical basis.

>The diamond's existence has material roots.

How do you know? You can't observe it.

>A number has nothing to prove existence,

You have nothing to prove existence; you could be an hallucination, or
the articles that I am reading could be written from somebody else.

>Include brackets, curly brackets (perhaps the book is on set theory,
>numbers, and you will need more than 35.

The question is not whether there are more than 35 symbols, but rather
how many strings of a give length are texts; natural languages have
grammars that exclude some strings, as does the nomenclature of
Mathematics.

Of course, you could also claim that texts don't exist. 

-- 
Shmuel (Seymour J.) Metz, SysProg and JOAT  <http://patriot.net/~shmuel>
Unsolicited bulk E-mail subject to legal action.  I reserve the
right to publicly post or ridicule any abusive E-mail.  Reply to
domain Patriot dot net user shmuel+news to contact me.  Do not
reply to spamtrap@library.lspace.org

Relevant Pages

  • Re: Create two-dimensional Array from string
    ... array from strings such as ... Let Perl parse it for you. ... Beware eval with unsanitized user inputs like ...
    (comp.lang.perl.misc)
  • trying to use the pumping lemma
    ... Here is my proof using the pumping lemma. ... observe a few strings in L ... contradiction since for v=0 we have 0^3 which is not in L. ...
    (comp.theory)
  • Re: How to efficiently determine if a string contains any one of many strings
    ... I am interested in machine classification of unknown texts. ... To me it seems like a good opportunity to use a state diagram sort of ... send you to the next state that is shared by the possible input strings ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: why use log in statistics?
    ... If frequencies of words in texts are evaluated, ... are modeled by the lognormal distribution (except that there are more ... strings of sufficient length will be also the string "all generated ...
    (sci.math)
  • Re: Logarithm of transfinite numbers
    ... Because the usual binary representation is defined on the strings ... they don't map to anything. ... Unsolicited bulk E-mail subject to legal action. ...
    (sci.math)