Complexity properties of recursively enumerable sets and \(bsQ\)-completeness

DOI10.1007/BF02676727zbMath1017.03020OpenAlexW4254549838MaRDI QIDQ5942014

Roland Sh. Omanadze

Publication date: 4 March 2003

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02676727

zbMATH Keywords

reducibilityeffectively speedable setrecursively enumerable set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Irreducible, singular, and contiguous degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity properties of recursively enumerable sets and \(sQ\)-completeness
• Reducibility and Completeness for Sets of Integers
• ON WAYS OF CHARACTERIZING COMPLETE SETS
• On subcreative sets and S-reducibility
• On complexity properties of recursively enumerable sets
• A Machine-Independent Theory of the Complexity of Recursive Functions

This page was built for publication: Complexity properties of recursively enumerable sets and \(bsQ\)-completeness