- From: Bullard, Claude L (Len) <clbullar@ingr.com>
- Date: Wed, 28 Aug 2002 16:25:38 -0500
- To: "'Paul Grosso'" <pgrosso@arbortext.com>
- Cc: www-tag@w3.org
Thar proof would indicate that while there are an infinite number of URIs, some of them are not processable in finite time; so again, the proof doesn't add a lot to the architecture. It does give Cantor a leg up. len -----Original Message----- From: Paul Grosso [mailto:pgrosso@arbortext.com] 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.
Received on Wednesday, 28 August 2002 17:26:11 UTC