Skip to main content
AkademIndex

Products

For developers

AkademBaseOpen API for the ecosystem
← Back to work

Works cited by this work

15 works

Work: On infinite direct sums of minimal numberings of functional families

  1. Recursively Enumerable Sets and Degrees

    Robert I. Soare

    Book198710 citations
    ABI

  2. On decomposition of Gödelnumberings into Friedbergnumberings

    Britta Schinzel

    Article19824 citations
    ABI

  3. Effectively infinite classes of numberings and computable families of reals

    M. Kh. Faĭzrahmanov, Z. K. Shchedrikova

    Article20234 citations
    ABI

  4. Algorithmic Randomness and Complexity

    Rodney G. Downey, Denis R. Hirschfeldt

    Book20102 citations
    ABI

  5. Arithmetic complexity via effective names for random sequences

    Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch

    Article20122 citations
    ABI

  6. Things that can be made into themselves

    Frank Stephan, Jason Teutsch

    Article20142 citations
    ABI

  7. Enumeration of families of general recursive functions

    Yu. L. Ershov

    Article19672 citations
    ABI

  8. The computable enumerations of families of general recursive functions

    С. С. Марченков

    Article19722 citations
    ABI

  9. Limitwise monotonic sets of reals

    M. Kh. Faĭzrahmanov, I. Sh. Kalimullin

    Article20152 citations
    ABI

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

    R. Friedberg

    Article19582 citations
    ABI

  11. Numberings and Randomness

    Paul Brodhead, Bjørn Kjos-Hanssen

    Chapter20092 citations
    ABI

  12. Reductions between types of numberings

    Ian Herbert, Sanjay Jain, Steffen Lempp +2

    Article20192 citations
    ABI

  13. Numberings and randomness

    Brodhead, Katie, Kjos-Hanssen, Bjørn

    Chapter20142 citations
    ABI

  14. Untitled

    Other2 citations
    ABI

  15. Positive enumerations

    S. A. Badaev

    Article19772 citations
    ABI