- From: Williams, Stuart <skw@hplb.hpl.hp.com>
- Date: Thu, 29 Aug 2002 15:05:22 +0100
- To: "'Anthony B. Coates'" <abcoates@TheOffice.net>, Paul Grosso <pgrosso@arbortext.com>
- Cc: www-tag <www-tag@w3.org>
A google search for "denumerable" turned up [1,2]. The intro [2] is entertaining enough and surely further confirmation that we should really drop the point from the document (which I believe we have agreed to do). Thanks, Stuart [1] http://descmath.com/diag/denum.html [2] http://descmath.com/diag/index.html > -----Original Message----- > From: Anthony B. Coates [mailto:abcoates@TheOffice.net] > Sent: 29 August 2002 10:56 > To: Paul Grosso > Cc: www-tag > Subject: Re: URI denumerability > > > > ** Reply to message from Paul Grosso <pgrosso@arbortext.com> > on Wed, 28 Aug > 2002 16:19:52 -0500 > > > The proof relies on the fact that the decimal representation of > > a real number can have an infinite number of digits. > > > > So the set of URIs is not denumerable if you allow a URI to > > have an infinite number of characters in its representation. > > No. I did pure maths at Uni, and I can assure you that URIs > are countable > (numerable), just as integers are. > > Cheers, > Tony. > ==== > Anthony B. Coates, Data Architect > mailto:abcoates@TheOffice.net > MDDL Editor (Market Data Definition Language) > http://www.mddl.org/ >
Received on Thursday, 29 August 2002 10:05:56 UTC