A class of enumerable sets

DOI10.1070/RM1999V054N03ABEH000163MaRDI QIDQ4501459zbMATH OpenOpenAlexFDO

Authors Andrej Muchnik, S. E. Positsel'Skiĭ

Publication date 26 July 2001

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/rm1999v054n03abeh000163

zbMATH Keywords

elasticityTuring completenessrecursively enumerable setsdegrees of non-recursivenessnon-elastic setsnon-recursive setsPost's problemsTuring incomplete setsweakly creative set

Mathematics Subject Classification ID

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

Recommendations

• On a Class of Recursively Enumerable Sets
• Some Theorems on Classes of Recursively Enumerable Sets
• On recursive enumerability with finite repetitions
• Complexity properties of recursively enumerable sets and sQ-completeness
• scientific article; zbMATH DE number 1138314

Cited in

(6)

• Counting set classes with Burnside's lemma
• scientific article; zbMATH DE number 4089516 (Why is no real title available?)
• Kolmogorov entropy in the context of computability theory
• scientific article; zbMATH DE number 1923100 (Why is no real title available?)
• Weakly semirecursive sets
• On a property of creative sets

This page was built for publication: A class of enumerable sets

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