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.
At this point it feels more difficult to ensure that your format cannot compute than to ensure it can
Does the Latin-Katakana example given imply that some input value can cause it to not terminate?
reminds me of Word's autocorrect being turing-complete <a href="https://www.youtube.com/watch?v=jlX_pThh7z8" rel="nofollow">https://www.youtube.com/watch?v=jlX_pThh7z8</a> (3:57, but whole video is fun)
Does this mean I could post some untransliterated text here in a comment and make your browsers all do these computations?
Waiting for someone to vibe a compiler targeting Unicode transliteration rules...
reminded me of the PowerPoint Turing Machine<p><a href="https://www.youtube.com/watch?v=uNjxe8ShM-8" rel="nofollow">https://www.youtube.com/watch?v=uNjxe8ShM-8</a>
Who implements transliteration rules? I assume operating systems? Or text renderers?
Does it work on modern OS or just PyICU ?