On computable enumerations. I

DOI10.1007/BF02219286zbMath0273.02024OpenAlexW4234042089MaRDI QIDQ2264759

Yuri L. Ershov

Publication date: 1969

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219286

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)

Related Items

Constructive periodic Abelian groups, On universal pairs in the Ershov hierarchy, A learning-theoretic characterization of classes of recursive functions, On some examples of upper semilattices of computable enumerations, The upper semilattice \(L(\gamma)\), Reducibility of partial recursive functions, Enumerations of families of general recursive functions, Recognition of invariant properties of algorithms, Hereditarily effective operations, The quantity of nonautoequivalent constructivizations, Positive enumerations, Rogers semilattices for families of equivalence relations in the Ershov hierarchy, On inseparable pairs, Constructive models of complete solvable theories, Learning by the process of elimination

Cites Work

• Degrees of Computability
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Creative Functions
• STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
• On the indexing of classes of recursively enumerable sets
• Godel Numberings Versus Friedberg Numberings
• Unnamed Item