Nicolas Seriot personal blog
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…
- Points
- 131
- HN comments
- 31
- Submissions
- 1
- Cited by
- 0 commenters
Software EngineeringMath & Algorithms2026
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Jul 8, 2026 | Unicode's transliteration rules are Turing-complete by beefburger | 131 | 31 |
