Unicode's Transliteration Rules Are Turing-Complete

/u/Dull_Replacement8890 2026年07月08日 17:45 7 次阅读来源：Reddit r/programming

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, shipped with every major OS. submitted by /u/Dull_Replacement8890 [link] [留言]

本文内容来源于互联网，版权归原作者所有