Classes of recursively enumerable sets and Q-reducibility

DOI10.1007/BF01158060zbMath0682.03027MaRDI QIDQ1823932

Roland Sh. Omanadze

Publication date: 1989

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

zbMATH Keywords

Q-reducibilitynon-T-complete sets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On complexity properties of recursively enumerable sets
• On degrees of unsolvability and complexity properties
• Computational complexity, speedable and levelable sets
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Semirecursive Sets and Positive Reducibility
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Classes of recursively enumerable sets and Q-reducibility