scientific article
From MaRDI portal
Publication:4011117
zbMath0753.03018MaRDI QIDQ4011117
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Mathematics, Metaphysics and the Multiverse ⋮ The machine as data: a computational view of emergence and definability ⋮ Ultrafilter spaces on the semilattice of partitions ⋮ Sets of generator and automorphism bases for the enumeration degrees ⋮ Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$