How much more powerful are regexes in modern programming languages compared to regular expressions from the theory of computation?
A famous example: a PCRE that finds primes. I couldn’t find Abigail’s original, but there have been many iterations on this. 

In JavaScript, for example, you can pass a function to the matcher to do arbitrary computation with the results.