Email this article Minimal generalized computable enumerations and high degrees
- Authors: Faizrahmanov M.K.1
-
Affiliations:
- Kazan (Volga Region) Federal University
- Issue: Vol 58, No 3 (2017)
- Pages: 553-558
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171267
- DOI: https://doi.org/10.1134/S0037446617030181
- ID: 171267
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
M. Kh. Faizrahmanov
Kazan (Volga Region) Federal University
Author for correspondence.
Email: marat.faizrahmanov@gmail.com
Russian Federation, Kazan
