Материалов:
1 005 012

Репозиториев:
30

Авторов:
596 024

По вашему запросу найдено документов: 38144

Страница 1 из 3815

Degrees of categoricity of computable structures
Fokina E., Kalimullin I., Miller R.
Defining the degree of categoricity of a computable structure M to be the least degree d for which
Graphs are not universal for online computability
Downey R., Harrison-Trainor M., Kalimullin I., Melnikov A., Turetsky D.
for “online” (punctual) computable structures. In contrast, we give a description of punctually categorical
Computing Load Distribution by Using Peer-to-Peer Network
Mamonov A., Varlamov R., Salpagarov S.
different areas of science, such as queueing theory and theory of computation, we create our own distributed
Distribution of Computing Load by using a P2P Network
Mamonov A.A., Varlamov R.A., Salpagarov S.I.
theory and theory of computation, we create our own distributed computing system. The main idea behind
Elementary theories and hereditary undecidability for semilattices of numberings
. We prove that the theory of the semilattice of all computable numberings is computably isomorphic
On the graph model and the equivalence of banyan networks
Basharin G.P., Zhukov O.V.
Computer systems
Degrees of categoricity of computable structures
Fokina E., Kalimullin I., Miller R.
Defining the degree of categoricity of a computable structure M to be the least degree d for which
ФТД.1 Вычислительная теория групп (Computational group theory) 2018 очная
ФТД.1 Вычислительная теория групп (Computational group theory) 2018 очная
ФТД.1 Вычислительная теория групп (Computational group theory) 2018 очная
ФТД.1 Вычислительная теория групп (Computational group theory) 2018 очная
ФТД.1 Вычислительная теория групп (Computational group theory) 2016 очная
ФТД.1 Вычислительная теория групп (Computational group theory) 2016 очная

Страница 1 из 3815

Фасеты

Новости проекта

Новости

Партнеры

КФУ
ТГУ
Elpub
СФУ
Webpublishers

Индексация

BASE
WorldCat
OpenAIRE
EDS
core