Unicode's Transliteration Rules Are Turing-Complete
https://seriot.ch/computation/uts35/
beefburger · 12 hours ago
1 comments
https://seriot.ch/computation/uts35/
beefburger · 12 hours ago
1 comments
beefburger · 12 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 · 12 hours ago
Huh, very interesting find, and very lean website (: