Tag
Unicode's transliteration rules (UTS #35) are proven to be Turing-complete by compiling 2-tag systems, showing termination is undecidable. This result affects the ICU library used in many systems.