Degrees of Autostability Relative to Strong Constructivizations of Graphs
Nikolay A. Bazhenov, M. I. Marchuk · Siberian Mathematical Journal · 2018
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.