Computable enumerations of families of general recursive functions

DOI10.1007/BF01668593zbMath0399.03028OpenAlexW2015721732MaRDI QIDQ1254245

S. A. Badaev

Publication date: 1978

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

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

zbMATH Keywords

Recursive FunctionsComputable Numbering

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items

Preserving categoricity and complexity of relations ⋮ On universal pairs in the Ershov hierarchy ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Complexity of Scott sentences ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ One-element Rogers semilattices in the Ershov hierarchy

Cites Work

• On computable enumerations. II