Unicode's transliteration rules are Turing-complete, Hacker News reports

A technical analysis reveals that Unicode's transliteration rules (UTS #35) are Turing-complete, allowing arbitrary computation. The discovery sparks discussion on Hacker News about the implications for text processing and security.

• Unicode's transliteration rules are Turing-complete