< BACK TO NEWS
importantSYS.SOURCE: seriot.ch2026-07-08T09:44:20Z

Unicode Transliteration Rules Demonstrate Turing-Completeness Through Computational Models

Unicode's UTS #35 transliteration rules demonstrate Turing-completeness by simulating computational models like 2-tag systems, the Collatz function, and Rule 110 cellular automata. The findings highlight the need for runtime safeguards in ICU's implementation due to undecidable termination.

Comments

Read original article

*** END OF TRANSMISSION ***