Kazan Federal University Digital Repository

Browsing Научные публикации в Scopus by Subject "Q-reducibility"

Browsing Научные публикации в Scopus by Subject "Q-reducibility"

Sort by: Order: Results:

  • Batyrshin I. (2017)
    © 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic reducibilities inside the degrees of weaker algorithmic ones. Results in this area are reviewed for algorithmic reducibilities ...
  • Batyrshin I. (2014)
    © 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibility on computably enumerable sets. We construct a noncomputable m-incomplete computably enumerable set B such that all ...
  • Arslanov M.; Batyrshin I.; Omanadze R. (2008)
    In this paper we study structural properties of n-c. e. Q-degrees. Two theorems contain results on the distribution of incomparable Q-degrees. In another theorem we prove that every incomplete Π2 0 Q-degree forms a minimal ...

Search DSpace

Advanced Search


My Account