The computable enumerations of families of general recursive functions

DOI10.1007/BF02330746zbMath0282.02015MaRDI QIDQ1843427

Sergey S. Marchenkov

Publication date: 1974

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

Mathematics Subject Classification ID

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

Related Items (12)

Fine hierarchy and definable index sets ⋮ The last question on recursively enumerable \(m\)-degrees ⋮ Algorithmic complexity of algebraic systems ⋮ Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I ⋮ Ideals without minimal elements in Rogers semilattices ⋮ A family with a single minimal but not least numbering ⋮ Some absolute properties of \(A\)-computable numberings ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ Computably enumerable sets and related issues ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ Undecidability and initial segments of the (r.e.) tt-degrees ⋮ Enumerations in computable structure theory

This page was built for publication: The computable enumerations of families of general recursive functions