Unicode's Transliteration Rules Are Turing-Complete
- The core Unicode algorithms (normalization, casing, bidi, collation) are deliberately bounded, but UTS #35 transliteration rules, under their natural unbounded semantics, are not.
- This is a result I haven't found published
Unverified
- The core Unicode algorithms (normalization, casing, bidi, collation) are deliberately bounded, but UTS #35 transliteration rules, under their natural unbounded semantics, are not.
- This is a result I haven't found published
Sources: Seriot