Unicode's transliteration rules are Turing-complete

(seriot.ch)

52 points | by beefburger 17 hours ago

11 comments

  • beefburger 17 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 17 hours ago
      Huh, very interesting find, and very lean website (:
  • anankaie 2 hours ago
    At this point it feels more difficult to ensure that your format cannot compute than to ensure it can
  • ks2048 1 hour ago
    Does the Latin-Katakana example given imply that some input value can cause it to not terminate?
  • NooneAtAll3 2 hours ago
    reminds me of Word's autocorrect being turing-complete https://www.youtube.com/watch?v=jlX_pThh7z8 (3:57, but whole video is fun)
  • hyperhello 1 hour ago
    Does this mean I could post some untransliterated text here in a comment and make your browsers all do these computations?
    • ks2048 1 hour ago
      I could be wrong, but I don't think it's common for websites to just transliterate any text they're given. Let's check: ウィキペディア
  • linzhangrun 2 hours ago
    Waiting for someone to vibe a compiler targeting Unicode transliteration rules...
  • sgjohnson 1 hour ago
    reminded me of the PowerPoint Turing Machine

    https://www.youtube.com/watch?v=uNjxe8ShM-8

  • dvt 1 hour ago
    Who implements transliteration rules? I assume operating systems? Or text renderers?
    • kccqzy 1 hour ago
      The ICU library. It’s so ubiquitous that it’s somewhat difficult to avoid this library if you are doing anything advanced with human text.
  • est 2 hours ago
    Does it work on modern OS or just PyICU ?
  • i18nagentai 0 minutes ago
    [flagged]