5 ms·
Which means you can't to general computation with it. You're just reiterating his point.
by formulathree 3y ago
Which means you can't to general computation with it. You're just reiterating his point.
- slaymaker1907 3y agoRegex (at least most implementations) isn't Turing complete, but you can still do a lot of stuff with it and I think most type systems go far beyond regex in expressive power. Unless you're trying to write quines, you probably don't need Turing completeness.