scientific article
From MaRDI portal
Publication:3792671
zbMath0648.03028MaRDI QIDQ3792671
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
minimal degreesindex setsrecursively enumerable setsTuring degreesrecursively enumerable degreesErshov's hierarchytheory of algorithmsPost's problemfinite injury methodhierarchy of high-low degreesweak recursively enumerable degrees
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (5)
A classification of low c.e. sets and the Ershov hierarchy ⋮ Application of precomplete enumerations to tabular-type degrees and index sets ⋮ Completeness in the arithmetical hierarchy and fixed points ⋮ Precomplete numberings ⋮ Index sets of quotient objects of the Post numeration
This page was built for publication:
