A class of enumerable sets

DOI10.1070/rm1999v054n03ABEH000163zbMath0965.03056OpenAlexW2328207350MaRDI QIDQ4501459

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

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)

Related Items (1)

Kolmogorov entropy in the context of computability theory

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