Minimal generalized computable enumerations and high degrees
- Авторлар: Faizrahmanov M.1
-
Мекемелер:
- Kazan (Volga Region) Federal University
- Шығарылым: Том 58, № 3 (2017)
- Беттер: 553-558
- Бөлім: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171267
- DOI: https://doi.org/10.1134/S0037446617030181
- ID: 171267
Дәйексөз келтіру
Аннотация
We establish that the set of minimal generalized computable enumerations of every infinite family computable with respect to a high oracle is effectively infinite. We find some sufficient condition for enumerations of the infinite families computable with respect to high oracles under which there exist minimal generalized computable enumerations that are irreducible to the enumerations.
Негізгі сөздер
Авторлар туралы
M. Faizrahmanov
Kazan (Volga Region) Federal University
Хат алмасуға жауапты Автор.
Email: marat.faizrahmanov@gmail.com
Ресей, Kazan