The index set of the groups autostable relative to strong constructivizations


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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


Copyright (c) 2017 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies