Unicode's transliteration rules are Turing-complete

bbeefburger about 16 hours ago 6 commentsRead Article on seriot.ch

⚡ Community Insights

Discussion Sentiment

50% Positive

Analyzed from 76 words in the discussion.

Discussion (6 Comments)Read Original on HackerNews

anankaie•3 minutes ago

At this point it feels more difficult to ensure that your format cannot compute than to ensure it can

NooneAtAll3•4 minutes ago

reminds me of Word's autocorrect being turing-complete https://www.youtube.com/watch?v=jlX_pThh7z8 (3:57)

beefburger•about 16 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•about 15 hours ago

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

est•9 minutes ago

Does it work on modern OS or just PyICU ?

linzhangrun•19 minutes ago

Waiting for someone to vibe a compiler targeting Unicode transliteration rules...