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
Some Properties of the Upper Semilattice of Computable Families of Computably Enumerable SetsWe look at specific features of the algebraic structure of an upper semilattice of
computable Initial segments of computable linear orders with additional computable predicatesWe study
computable linear orders with
computable neighborhood and block predicates. In particular