По вашему запросу найдено документов: 1005012
Страница 1 из 100502
Minimal generalized computable enumerations and high degrees© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable
Minimal generalized computable enumerations and high degrees© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable
Q-reducibility and m-reducibility on computably enumerable sets-reducibility on computably enumerable sets. We construct a noncomputable m-incomplete computably enumerable set B
Isolated 2-computably enumerable Q-degrees properly 2-computably enumerable degree d such that a
Isolated 2-computably enumerable Q-degrees properly 2-computably enumerable degree d such that aQ-reducibility and m-reducibility on computably enumerable sets-reducibility on computably enumerable sets. We construct a noncomputable m-incomplete computably enumerable set BStrong noncuppability in low computably enumerable degreesWe prove the existence of noncomputable low computably enumerable degrees b < a such that bAlmost computably enumerable families of sets. Moreover, it is established that for any computably enumerable (c.e.) set A there exists afamily that is XTuring and enumeration jumps in the Ershov hierarchyIn the article, we study the behaviour of enumeration jumps of sets of low e-degrees in the ErshovStrong noncuppability in low computably enumerable degreesWe prove the existence of noncomputable low computably enumerable degrees b < a such that bСтраница 1 из 100502
Фасеты
Партнеры
Индексация
