Unicode's Transliteration Rules Are Turing-Complete

6 pointsposted 6 hours ago
by beefburger

2 Comments

beefburger

6 hours 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.

bielok

5 hours ago

Huh, very interesting find, and very lean website (: