Unicode Transliteration Rules Proven Turing-Complete

Separating Problem Solving from Code Generation: Evaluating LLMs on Competitive Programming Through Natural-Language Editorials

Large Language Models (LLMs) increasingly succeed on competitive programming problems, yet existing evaluations conflate algorithmic reasoni

Beyond Call Boundaries: The Case for Semantic Language Interoperability

Programming languages become interoperable when they attach to shared semantic contracts: identity, data shape, effects, ownership, runtime

ACM Transactions on Mathematical Software (toms) Vol 52, Issue 2

ACM Transactions on Computation Theory (toct) Vol 18, Issue 2

Less Is More: Reducing Token Counts Without Compromising Performance

arXiv:2506.15138v2 Announce Type: replace Abstract: Tokenization directly affects the inference efficiency of large language models, since f