The index set of the groups autostable relative to strong constructivizations
- Authors: Goncharov S.S.1, Bazhenov N.A.1, Marchuk M.I.1
-
Affiliations:
- Sobolev Institute of Mathematics
- Issue: Vol 58, No 1 (2017)
- Pages: 72-77
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/170934
- DOI: https://doi.org/10.1134/S0037446617010104
- ID: 170934
Cite item
Abstract
We obtain an exact bound for the algorithmic complexity of the class of strongly constructivizable computable groups that are autostable relative to strong constructivizations.
About the authors
S. S. Goncharov
Sobolev Institute of Mathematics
Author for correspondence.
Email: s.s.goncharov@math.nsc.ru
Russian Federation, Novosibirsk
N. A. Bazhenov
Sobolev Institute of Mathematics
Email: s.s.goncharov@math.nsc.ru
Russian Federation, Novosibirsk
M. I. Marchuk
Sobolev Institute of Mathematics
Email: s.s.goncharov@math.nsc.ru
Russian Federation, Novosibirsk