W3C home > Mailing lists > Public > www-rdf-interest@w3.org > January 2002

Re: Identifying reals

From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
Date: Fri, 04 Jan 2002 12:45:27 -0500
To: distobj@acm.org
Cc: msabin@interx.com, www-rdf-interest@w3.org
Message-Id: <20020104124527E.pfps@research.bell-labs.com>
From: Mark Baker <distobj@acm.org>
Subject: Identifying reals
Date: Fri, 4 Jan 2002 11:58:19 -0500 (EST)

> > Mark Baker wrote,
> > > Ok, so I'll identify it as;
> > >
> > > http://example.org/numbers/real/peters-example-real
> > 
> > Reread peters argument ... this one's already taken. _All_ of them
> > are already taken. And if you still don't believe it google for
> > "Cantors diagonal argument".
> 
> Ah, I missed the "URIs are a finite sequence ..." assumption.
> 
> The problem is that this assumption is incorrect.  

Show me a URI that violates this assumption.

> You may have trouble
> passing arbitrarily large ones around, but that doesn't prevent them
> from being defined.  Earlier Peter said "How many URIs are there?  Only
> countably infinite.", which is correct, but inconsistent with saying
> that URIs are a finite sequence.  

> If they were a finite sequence then
> there would be finite number of them.  So my point stands.

Wrong.  There are a countably infinite number of finite sequences of
characters.  Please educate yourself more fully.

> Weee, this is fun.  Time for a subject change though; better late than
> never.

If you are going to argue, please restrict yourself to correct points.

> MB

peter
Received on Friday, 4 January 2002 12:45:55 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:52 GMT