Asosiy kontentga oʻtish
AkademIndex

Mahsulotlar

Ishlab chiquvchilar uchun

AkademBasetez oradaEkotizim uchun ochiq API
Lotin
← Ishga qaytish

Ushbu ish iqtibos qilgan ishlar

15 ta ish

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

  1. Recursively Enumerable Sets and Degrees

    Robert I. Soare

    Kitob198710 iqtibos
    ABI

  2. On decomposition of Gödelnumberings into Friedbergnumberings

    Britta Schinzel

    Maqola19824 iqtibos
    ABI

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

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

    Maqola20234 iqtibos
    ABI

  4. Algorithmic Randomness and Complexity

    Rodney G. Downey, Denis R. Hirschfeldt

    Kitob20102 iqtibos
    ABI

  5. Arithmetic complexity via effective names for random sequences

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

    Maqola20122 iqtibos
    ABI

  6. Things that can be made into themselves

    Frank Stephan, Jason Teutsch

    Maqola20142 iqtibos
    ABI

  7. Enumeration of families of general recursive functions

    Yu. L. Ershov

    Maqola19672 iqtibos
    ABI

  8. The computable enumerations of families of general recursive functions

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

    Maqola19722 iqtibos
    ABI

  9. Limitwise monotonic sets of reals

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

    Maqola20152 iqtibos
    ABI

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

    R. Friedberg

    Maqola19582 iqtibos
    ABI

  11. Numberings and Randomness

    Paul Brodhead, Bjørn Kjos-Hanssen

    Bob20092 iqtibos
    ABI

  12. Reductions between types of numberings

    Ian Herbert, Sanjay Jain, Steffen Lempp +2

    Maqola20192 iqtibos
    ABI

  13. Numberings and randomness

    Brodhead, Katie, Kjos-Hanssen, Bjørn

    Bob20142 iqtibos
    ABI

  14. Sarlavhasiz

    Boshqa2 iqtibos
    ABI

  15. Positive enumerations

    S. A. Badaev

    Maqola19772 iqtibos
    ABI