Rice Theorems For D.R.E. Sets
From MaRDI portal
Publication:4067081
DOI10.4153/CJM-1975-043-4zbMath0309.02040MaRDI QIDQ4067081
Publication date: 1975
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (6)
Program Size Complexity of Correction Grammars in the Ershov Hierarchy ⋮ Index sets in the arithmetical hierarchy ⋮ Completeness in the arithmetical hierarchy and fixed points ⋮ Precomplete numberings ⋮ Classifications of generalized index sets of open classes ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars
This page was built for publication: Rice Theorems For D.R.E. Sets