Email this article Index Sets of Constructive Models of Finite and Graph Signatures that are Autostable Relative to Strong Constructivizations
- Authors: Goncharov S.S.1,2, Marchuk M.I.1
-
Affiliations:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Issue: Vol 54, No 6 (2016)
- Pages: 428-439
- Section: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/233960
- DOI: https://doi.org/10.1007/s10469-016-9365-x
- ID: 233960
Cite item
Open Access
Access granted
Subscription Access
Abstract
We estimate algorithmic complexity of the class of computable models of finite and graph signatures that have a strong constructivization and are autostable relative to strong constructivizations.
Keywords
About the authors
S. S. Goncharov
Sobolev Institute of Mathematics; Novosibirsk State University
Author for correspondence.
Email: s.s.goncharov@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
M. I. Marchuk
Sobolev Institute of Mathematics
Author for correspondence.
Email: margaretmarchuk@gmail.com
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090
Supplementary files
