По вашему запросу найдено документов: 1005012
Страница 14 из 100502
Automatic and Polynomial-Time Algebraic Structures structure has, or does not have, an automatic presentation. We answer this question by showing that the set
A Note on Computation MTs with Time in Instructions or with Tapes of Fixed LengthIn this short note we analyze the computation algorithms modelled by Church-Turing-Post
machines
Definable relations in Turing degree structuresIn this article, we investigate questions about the definability of classes of n-c. e. sets
Definable relations in Turing degree structuresIn this article, we investigate questions about the definability of classes of n-c. e. sets
Using docker to deploy computing software training set containing 60 thousand copies was used, and the test set includes 10 thousand copies
The Development of Sociocultural Competence with the Help of Computer Technology of the process of development sociocultural knowledge and competences using computer technologies. On the whole
The Development of Sociocultural Competence with the Help of Computer Technology of the process of development sociocultural knowledge and competences using computer technologies. On the whole
Degree spectra of the successor relation of computable linear orderingsWe establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c
A (3, 3)-homogeneous quantum logic with 18 atoms. i (with respect to inclusion) orthogonal sets of atoms (we call them blocks), and every block contains
Interpolating d-r.e. and REA degrees between r.e. degreesWe provide three new results about interpolating 2-r.e. (i.e. d-r.e.) or 2-REA (recursively
Страница 14 из 100502
Фасеты
Партнеры
Индексация
