invpix·3 lata temu·discussGreat article! Ah someone else also read it through..."Matching of regular expressions is NP-complete. As such you can solve any other NP problem using regular expressions."Would love to see that be the mechanism of that proof.
invpix·3 lata temu·discussIs this a proof of human created quality over AI generation?Seriously though, wonderful work.