电邮这篇文章 Degrees of Autostability Relative to Strong Constructivizations of Graphs
- 作者: Bazhenov N.A.1, Marchuk M.I.1
-
隶属关系:
- Sobolev Institute of Mathematics
- 期: 卷 59, 编号 4 (2018)
- 页面: 565-577
- 栏目: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171937
- DOI: https://doi.org/10.1134/S0037446618040018
- ID: 171937
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
N. Bazhenov
Sobolev Institute of Mathematics
编辑信件的主要联系方式.
Email: bazhenov@math.nsc.ru
俄罗斯联邦, Novosibirsk
M. Marchuk
Sobolev Institute of Mathematics
Email: bazhenov@math.nsc.ru
俄罗斯联邦, Novosibirsk
补充文件
