Tensor computations in computer algebra systemsThis paper considers three types of tensor
computations. On their basis, we attempt to formulate
Execution for complex program set at the parallel computing systems time for complex program set at the parallel
computing system with given or supposed
computer Degrees of categoricity of computable structuresDefining the degree of categoricity of a
computable structure M to be the least degree d for which
WEAK REDUCIBILITY OF COMPUTABLE AND GENERALIZED COMPUTABLE NUMBERINGSWe consider universal and minimal
computable numberings with respect to weak reducibility. A family
Вестник мировой науки. Серия: Филология. ~. Computer-Mediated Communication and the LanguageВестник мировой науки. Серия: Филология. ~.
Computer-Mediated Communication and the Language
Вестник мировой науки. Серия: Филология. ~. Computer-Mediated Communication and the LanguageВестник мировой науки. Серия: Филология. ~.
Computer-Mediated Communication and the Language
Вестник мировой науки. Серия: Филология. ~. Computer-Mediated Communication and the LanguageВестник мировой науки. Серия: Филология. ~.
Computer-Mediated Communication and the Language
Вестник мировой науки. Серия: Филология. ~. Computer-Mediated Communication and the LanguageВестник мировой науки. Серия: Филология. ~.
Computer-Mediated Communication and the Language