По вашему запросу найдено документов: 19884
Страница 1 из 1989
Turing and enumeration jumps in the Ershov hierarchyIn the article, we study the behaviour of enumeration jumps of sets of low e-degrees in the Ershov
Q-reducibility and m-reducibility on computably enumerable sets© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibility
Q-reducibility and m-reducibility on computably enumerable sets© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibility
Turing and enumeration jumps in the Ershov hierarchyIn the article, we study the behaviour of enumeration jumps of sets of low e-degrees in the Ershov
Isolated 2-computably enumerable Q-degreesIn this work we prove that for every pair of computably enumerable degrees a
Isolated 2-computably enumerable Q-degreesIn this work we prove that for every pair of computably enumerable degrees aMinimal generalized computable enumerations and high degrees enumerations of every infinite family computable with respect to a high oracle is effectively infinite. We findEnumeration degrees and enumerability of familes family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerableEnumeration degrees and enumerability of familes family of finite sets is e-reducible to every non-zero e-degree, then the family is computably enumerableIrreducible, Singular, and Contiguous Degrees algorithmic reducibilities inside the degrees of weaker algorithmic ones. Results in this area are reviewedСтраница 1 из 1989
Фасеты
Партнеры
Индексация
