lua-users home
lua-l archive

[Date Prev][Date Next][Thread Prev][Thread Next] [Date Index] [Thread Index]

2017-02-24 14:28 GMT+02:00 Roberto Ierusalimschy <>:

> because of back references, Perl's regexs are NP-complete: you can code
> any NP problem as a regex plus a subject string (in polynomial time) and
> Perl will solve the problem (not in polynomial time :-).

To all those poets and artists who pity mathematicans and computer
scientists as soulless geeks who cannot comprehend beauty: this result,
in the words of one of your own number, is beauty bare.