note: the info on this page is incorrect. The page remains here only as a historical record. Thanks to Yuri Kan for correction.
here's a example of computing complexity induced by limited number of characters in a char set.
in articles on Unicode, Unicode chars may be marked up like this:
in web browser, it shows like this α.
Now, here's the problem. If your char is the LESS-THAN SIGN, you have to use HTML entities. So, it looks like this:
For many more examples of the ASCII Jam problem, see: Problems of Symbol Congestion in Computer Languages; ASCII Jam vs Unicode.blog comments powered by Disqus