By definition regular expressions are not Turing complete... There is an ordering relationship between turing machines and regular expressions which explicitly

By definition regular expressions are not Turing complete... There is an ordering relationship between turing machines and regular expressions which explicitly states regular expressions are strictly a subset of turning machines. This is automata theory 101. Ask for a refund from your school. Jesus what has this field come to.