Email this article Degrees of Autostability Relative to Strong Constructivizations of Graphs
- Authors: Bazhenov N.A.1, Marchuk M.I.1
-
Affiliations:
- Sobolev Institute of Mathematics
- Issue: Vol 59, No 4 (2018)
- Pages: 565-577
- Section: Article
- URL: https://journal-vniispk.ru/0037-4466/article/view/171937
- DOI: https://doi.org/10.1134/S0037446618040018
- ID: 171937
Cite item
Open Access
Access granted
Subscription Access
Abstract
We show that each computably enumerable Turing degree is a degree of autostability relative to strong constructivizations for a decidable directed graph. We construct a decidable undirected graph whose autostability spectrum relative to strong constructivizations is equal to the set of all PA-degrees.
Keywords
About the authors
N. A. Bazhenov
Sobolev Institute of Mathematics
Author for correspondence.
Email: bazhenov@math.nsc.ru
Russian Federation, Novosibirsk
M. I. Marchuk
Sobolev Institute of Mathematics
Email: bazhenov@math.nsc.ru
Russian Federation, Novosibirsk
Supplementary files
