scientific article; zbMATH DE number 3639607
From MaRDI portal
zbMath0412.03027MaRDI QIDQ4198494
Publication date: 1979
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) Algorithms in computer science (68W99)
Related Items
Completeness in the arithmetical hierarchy and fixed points, Comparison of linear reducibility with other reducibilities of tabular type
