It has been demonstrated that Unicode's UTS #35 transliteration rules are Turing-complete, with one developer successfully computing the Collatz conjecture using just three rewrite rules in the stock ICU library. While discovering Turing-complete weird machines in mundane data formats is a fascinating computer science novelty, the practical security risk is minimal because the rules are strictly controlled by software vendors and engines enforce rewrite limits. Furthermore, given the immense complexity required to support thousands of global languages and contextual text transformations, developers note that it would actually be more surprising if Unicode's formatting options were not Turing-complete.