--- On Sun, 4/27/08, Volkan YAZICI <[EMAIL PROTECTED]> wrote:
> (The shortest
> palindromic
> pangram can be hidden in other nodes of the probability
> tree where there
> is no symmetric words.)
I wonder if you attempted to brute-force building the tree
(in C, I suppose). And are there any known limits it hits:
memory or time?
____________________________________________________________________________________
Be a better friend, newshound, and
know-it-all with Yahoo! Mobile. Try it now.
http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
