Unicode's transliteration rules are Turing-complete
Claim: as specified, the UTS #35 transliteration-rule language is Turing-complete. This is an exception in Unicode, where algorithms are deliberately bounded and always terminate. The specification defines a revisiting cursor with no rewrite limit. ICU's implementation implements a per-call cap, but the spec itself…