Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1109.03039OpenAlexW4296156427MaRDI QIDQ5898859

Noam Greenberg, Rodney G. Downey

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computably enumerable degreesnaturally definable degree classes

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

A classification of low c.e. sets and the Ershov hierarchy ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ Hierarchy of Computably Enumerable Degrees II

This page was built for publication: Theory and Applications of Models of Computation