Some remarks about classes of recursively enumerable sets

DOI10.1007/BF00967370zbMath0409.03023OpenAlexW2010137565MaRDI QIDQ1258731

Victor L. Selivanov

Publication date: 1978

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

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

zbMATH Keywords

ComplexityHierarchyComputable NumberingRecursively Enumerable Set

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Related Items (2)

Towards a descriptive set theory for domain-like structures ⋮ On the main scientific achievements of Victor Selivanov

Cites Work

• Index sets in Ershov's hierarchy
• On the indexing of classes of recursively enumerable sets

This page was built for publication: Some remarks about classes of recursively enumerable sets