-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Sat, 28 Aug 2004 01:21, Chris Devers wrote: > Rather than trying to find a tool for this, you'll be much better off > trying to come up with an understanding of what within the patterns that NP-Hard problems are still quite possible to solve. I work with solving them a fair bit. What can't be done is a guaranteed optimal solution in a faster-than-brute-force manner. Brute force is fine if you have a small number of cases.
> My hunch is that flinging a bunch of text at some kind of regex maker > and telling it to figure out on its own how to match or not match > different examples is going to be a variant of the halting problem. Possibly, but again it doesn't make it unsolvable if you restrict it to sets of cases. For example, if you supply a pair of messages of one class but with a different variable section, creating a regex for that will be easy. - -- Robin <[EMAIL PROTECTED]> JabberID: <[EMAIL PROTECTED]> Hostes alienigeni me abduxerunt. Qui annus est? PGP Key 0x776DB663 = DD10 5C62 1E29 A385 9866 0853 CD38 E07A 776D B663 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.3 (GNU/Linux) iD8DBQFBMSBRzTjgendttmMRAvhoAKCknRrU6s/TwGsTqHlmvfOCq4YQVQCfdd1y KSVACqC4LjttKs8qaNFI0NI= =PHU5 -----END PGP SIGNATURE----- -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] <http://learn.perl.org/> <http://learn.perl.org/first-response>
