Просмотр по теме "low set"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • CEA Operators and the Ershov Hierarchy 
    Arslanov M.M.; Batyrshin I.I.; Yamaleev M.M. (2021)
    We examine the relationship between the CEA hierarchy and the Ershov hierarchy within $\Delta_2^0$ Turing degrees. We study the long-standing problem raised in [1] about the existence of a low computably enumerable (c.e.) ...
  • Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy 
    Faizrahmanov M. (2010)
    If ν and μ are some Δcomputable numberings of families of sets of the naturals then P(x,y) ⇔ ν(x)′ ≠ μ(y) is a Σpredicate. Deriving corollaries from this result, we obtain a sufficient condition for existence of a Δcomputable ...

Поиск в электронном архиве

Просмотр

Моя учетная запись