Unicode's Transliteration Rules Are Turing-Complete
Summary
The article demonstrates that Unicode's transliteration rules, while intended for locale transformations, have unbounded semantics that can enable universal computation. Through examples like 2-tag systems, the Collatz function, and Rule 110, it shows that transliteration data can act as executable programs, with ICU's guard illustrating practical termination bounds. The piece argues for reviewing and bounding transform data when accepted from external sources.