scientific article
From MaRDI portal
Publication:3567853
zbMath1203.03056MaRDI QIDQ3567853
Yue Yang, Liang Yu, Frank Stephan
Publication date: 17 June 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)
Related Items (6)
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ Weak density and nondensity among transfinite levels of the Ershov hierarchy ⋮ Reductions between types of numberings
This page was built for publication:
