On computable enumerations. II
From MaRDI portal
Publication:2264760
DOI10.1007/BF02219821zbMath0273.02025MaRDI QIDQ2264760
Publication date: 1970
Published in: Algebra and Logic (Search for Journal in Brave)
03D20: Recursive functions and relations, subrecursive hierarchies
03D25: Recursively (computably) enumerable sets and degrees
03D99: Computability and recursion theory
Related Items
Computably enumerable sets and related issues, The d.r.e. degrees are not dense, Some effectively infinite classes of enumerations, Index sets in 0', Computable enumerations of families of general recursive functions
Cites Work