Асосий контентга ўтиш
AkademIndex

Маҳсулотлар

Ишлаб чиқувчилар учун

AkademBaseЭкотизим учун очиқ API
← Ишга қайтиш

Ушбу иш иқтибос қилган ишлар

15 та иш

Иш: On infinite direct sums of minimal numberings of functional families

  1. Recursively Enumerable Sets and Degrees

    Robert I. Soare

    Китоб198710 иқтибос
    ABI

  2. On decomposition of Gödelnumberings into Friedbergnumberings

    Britta Schinzel

    Мақола19824 иқтибос
    ABI

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

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

    Мақола20234 иқтибос
    ABI

  4. Algorithmic Randomness and Complexity

    Rodney G. Downey, Denis R. Hirschfeldt

    Китоб20102 иқтибос
    ABI

  5. Arithmetic complexity via effective names for random sequences

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

    Мақола20122 иқтибос
    ABI

  6. Things that can be made into themselves

    Frank Stephan, Jason Teutsch

    Мақола20142 иқтибос
    ABI

  7. Enumeration of families of general recursive functions

    Yu. L. Ershov

    Мақола19672 иқтибос
    ABI

  8. The computable enumerations of families of general recursive functions

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

    Мақола19722 иқтибос
    ABI

  9. Limitwise monotonic sets of reals

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

    Мақола20152 иқтибос
    ABI

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

    R. Friedberg

    Мақола19582 иқтибос
    ABI

  11. Numberings and Randomness

    Paul Brodhead, Bjørn Kjos-Hanssen

    Боб20092 иқтибос
    ABI

  12. Reductions between types of numberings

    Ian Herbert, Sanjay Jain, Steffen Lempp +2

    Мақола20192 иқтибос
    ABI

  13. Numberings and randomness

    Brodhead, Katie, Kjos-Hanssen, Bjørn

    Боб20142 иқтибос
    ABI

  14. Сарлавҳасиз

    Бошқа2 иқтибос
    ABI

  15. Positive enumerations

    S. A. Badaev

    Мақола19772 иқтибос
    ABI