On Tue, 16 Feb 2010 21:31:35, Domas Mituzas midom.lists@gmail.com wrote:

Random strings are easy to identify, fixed strings are easy to verify.

Maybe this is naive of me, but that sounds like an interesting problem. It seems to me that randomized strings that are made of real words are kind of difficult to identify... So, in the spirit of learning something cool (not in the spirit of challenging what you're saying), how would one identify random strings?

Thanks, Aerik