Unicode's Transliteration Rules Are Turing-Complete

192 · llimllib's notes · July 9, 2026, 11:44 a.m.
Summary
The blog post discusses how Unicode's transliteration rules can be used creatively to execute arbitrary programs, demonstrating their Turing-completeness. Written by Nicolas Seriot, the article showcases a novel perspective on Unicode's functionality, providing insights that could intrigue developers and engineers.