Re: URI denumerability

/ Tim Bray <tbray@textuality.com> was heard to say:
| denumerable. If you could arrange for a finite-length way to encode
| irrational numbers (aside from special cases such as e and pi) you'd
| be right, but I'm pretty sure that in principle you can't.  Because if
| you could then they'd be denumerable just like URIs. -Tim

I don't think the proof hinges on irrational numbers. The
diagonalization proof that real numbers are not denumerable relies on
the fact that you can always manufacture a new real number that is
demonstrably not in your list. Whether or not that number is
irrational is incidental. I think. :-)

                                        Be seeing you,
                                          norm

-- 
Norman.Walsh@Sun.COM    | You look wise. Pray correct that
XML Standards Architect | error.--Charles Lamb
Sun Microsystems, Inc.  |