Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works citing this work

2 works

Work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

  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
    ABI

  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
    ABI