Unicode's Transliteration Rules Are Turing-Complete: A Hidden Computation Engine

Unicode's transliteration rules are Turing-complete

I discovered that Unicode's UTS #35 transliteration rules, designed for simple text conversion, are actually Turing-complete. By implementing 2-tag systems, I demonstrated that these rules can simulate complex computations like the Collatz function and Rule 110. This means standard locale data files shipped in ICU are effectively programs, making termination undecidable and requiring careful runtime bounds.

"The above discussion demonstrates that a transliteration rule file is not just data, it's a program."