Works citing this work

2 works

Work: The computable enumerations of families of general recursive functions

1. On infinite direct sums of minimal numberings of functional families

   Sh. D. Nodirov, M. Kh. Faĭzrahmanov, Z. K. Shchedrikova

   ArticleComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 citations

   ABIABI:AkademIndex/openalex/2025.article.004988

2. On Infinite Direct Sums of Minimal Numberings of Functional Families

   Sh. D. Nodirov, M. Kh. Faĭzrahmanov, Z. K. Shchedrikova

   ArticleComputability, Logic, AI AlgorithmsRussian Mathematics20250 citations

   ABIABI:AkademIndex/openalex/2025.article.006829