scientific article; zbMATH DE number 1138314

zbMATH Open0895.03018MaRDI QIDQ4383591FDOQ4383591

Authors: Roland Sh. Omanadze 

Publication date: 1 July 1998

Title of this publication is not available (Why is that?)

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_1\)-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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (8)

• Complexity properties of recursively enumerable sets and \(bsQ\)-completeness
• \(sQ_1\)-degrees of computably enumerable sets
• Complexity properties of recursively enumerable sets and \(sQ\)-completeness
• On \(sQ\)-completeness of recursively enumerable sets
• Title not available (Why is that?)
• On a property of creative sets
• Title not available (Why is that?)
• Major sets, classes of simple sets, and Q-complete sets

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)