Unicode's Transliteration Rules Are Turing-Complete
4 points
59 minutes ago
| 1 comment
| seriot.ch
| HN
beefburger
59 minutes ago
[-]
I've been wondering for a while if anything in Unicode could accidentally compute. It turns out that UTS #35 transliteration rules are Turing-complete. I show how to compute Collatz with just 3 rewrite rules running on stock ICU.
reply
bielok
7 minutes ago
[-]
Huh, very interesting find, and very lean blog (:
reply