scientific article; zbMATH DE number 1138314

MaRDI QIDQ4383591zbMATH OpenFDO

Authors Roland Sh. Omanadze

Publication date 1 July 1998

zbMATH Keywords

\(sQ\)-complete setseffectively subcreative setsrecursively enumerable degreesrecursively enumerable setsstrongly effectively speedable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Complexity properties of recursively enumerable sets and sQ-completeness
• Complexity properties of recursively enumerable sets and bsQ-completeness
• On \(sQ\)-completeness of recursively enumerable sets
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
• DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY
• sQ₁-degrees of computably enumerable sets
• scientific article; zbMATH DE number 3914303
• scientific article; zbMATH DE number 3896921
• Computably enumerable sets and quasi-reducibility
• Kolmogorov complexity and computably enumerable sets

Cited in

(10)

• Complexity properties of recursively enumerable sets and sQ-completeness
• On \(sQ\)-completeness of recursively enumerable sets
• Major sets, classes of simple sets, and Q-complete sets
• sQ₁-degrees of computably enumerable sets
• On a property of creative sets
• scientific article; zbMATH DE number 3847369 (Why is no real title available?)
• scientific article; zbMATH DE number 123920 (Why is no real title available?)
• A class of enumerable sets
• Complexity properties of recursively enumerable sets and bsQ-completeness
• On quasi-reducibility for c.e. sets. I: The structure of the Q-degrees and the sQ-degrees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383591)