> From: William Overington [mailto:WOverington@ngo.globalnet.co.uk]
>
> Can there be found a possible usage that such a scheme would
> not support?
> Finding just one would resolve the question.
I suspect that the whole issue is covered by Goedel's(sp?)
Incompleteness theorem, which says (approximately) that any mathematical
system above a certain complexity can not be fully mathematically described
(characterized) within itself. Any scheme to describe PUA usage involving
only PUA characters cannot be distinguished with certainty from random use
of PUA characters. A scheme which used non-PUA characters could work, but,
as has been stated many times, will not happen.
I'd like to point out that I consider it a Good Thing not to have a
classification system. Should I choose to use PUA characters, I don't want
any application that I didn't write attempting to interpret their meaning,
since I may use them for anything (wasn't it you, William, who was working
on a soft processor which used PUA codepoints as instructions?) and I don't
want to waste time describing the usage for other applications (if the usage
can even be described).
/|/|ike
This archive was generated by hypermail 2.1.2 : Fri Jul 06 2001 - 00:18:16 EDT