scientific article; zbMATH DE number 3885889

MaRDI QIDQ3220577zbMATH OpenFDO

Authors F. I. Validov

Publication date 1984

zbMATH Keywords

effectively discrete numbering

Mathematics Subject Classification ID

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

Recommendations

• Discrete families of recursive functions and index sets
• On cardinality of semilattices of enumerations of nondiscrete families
• scientific article; zbMATH DE number 3857079
• scientific article; zbMATH DE number 3557772
• scientific article; zbMATH DE number 3995654

Cited in

(9)

• scientific article; zbMATH DE number 2154084 (Why is no real title available?)
• Generic amplification of recursively enumerable sets
• Productive sets and constructively nonpartial-recursive functions
• scientific article; zbMATH DE number 3995654 (Why is no real title available?)
• Discrete families of recursive functions and index sets
• Recursion theoretic properties of frequency computation and bounded queries
• scientific article; zbMATH DE number 1195580 (Why is no real title available?)
• scientific article; zbMATH DE number 3867311 (Why is no real title available?)
• Recursively defined combinatorial functions: Extending Galton's board

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220577)