Regular expressions are not Turing complete because they are limited in their ability to represent arbitrary computations. Regular expressions are used to match patterns in strings, but they are not capable of performing operations that require more complex logic, such as looping or branching. As such, regular expressions are limited to the kinds of computations that can be expressed as a single pattern-matching expression.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence