Index Sets

Index Sets is a formal construct in computability theory that denotes a set of natural numbers coding the indices of partial recursive functions with a specified property, distinguishing it as a tool for classifying decision problems according to their algorithmic unsolvability.

222

Publications

9.2K

Citations

504

Authors

249

Institutions

Publications per year

2017–2026

27

Authors

504

  1. VS
    Victor Selivanov

    Russian Academy of Sciences, Russia

    5 publications · 80 citations

    5

    h-index

  2. AK
    Ambuj K. Singh

    University of California, Santa Barbara, United States

    5 publications · 203 citations

    5

    h-index

  3. TK
    Tamer Kahveci

    University of Florida, United States

    4 publications · 164 citations

    4

    h-index

  4. JF
    Julia F. Knight

    University of Notre Dame, United States

    4 publications · 86 citations

    4

    h-index

  5. SL
    Sin-Min Lee

    San Jose State University, United States

    3 publications · 59 citations

    3

    h-index

1–5 of 504

Venues

  1. Algebra and Logic

    10 publications · 166 citations

    10

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 7 publications · 302 citations

    7

    h-index

  3. Journal of Symbolic Logic

    6 publications · 132 citations

    6

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 5 publications · 386 citations

    5

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 87 citations

    3

    h-index

1–5