>your application (Google should be able to return lots of computer
>science course notes with info on how that works). It would be a lot more
>work over basic string comparisons though.

Why more work ? If one renounces the final comparison (to make sure that
the string is the string and not an alias in the hash space) then the hash
is very simple. And since the string table is fixed one can program a hash
algorythm finder, to be run on a PC, that will map the string set directly
to a minimal set of commands.

Peter

--
http://www.piclist.com hint: To leave the PICList
mailto:piclist-unsubscribe-request@mitvma.mit.edu