invpix

10 ms·

1. 1.▲
   by invpix 3y ago

   I've had this suspicion for so long, thanks!
2. 2.▲
   by invpix 3y ago

   Great 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.
3. 3.▲
   by invpix 3y ago

   Is this a proof of human created quality over AI generation? Seriously though, wonderful work.
4. 4.▲
   by invpix 4y ago

   Anyone else notice TenetLang looks an awful lot like Motoko?