Remark on a Computer-Oriented Language

In this paper, we consider a Russian-Chinese pidgin, a steady simplified language, whose properties can be modeled in creating a computer-oriented language. Word combinations united into descriptors of the pidgin, which corresponds to adapted Russian, obey the Bose–Einstein statistics. Assuming that, under certain conditions, the steady pidgin gives the maximum of the specified information, we formulate a hypothesis about compression of descriptors for a computer-oriented language.