Recursively Enumerable Sets

Recursively Enumerable Sets is a formal concept in computability theory denoting a set of natural numbers that is semi-decidable, meaning there exists a Turing machine which halts and accepts exactly those elements in the set, but may not halt on elements outside it.

337

Publications

16.6K

Citations

288

Authors

178

Institutions

Publications per year

2017–2026

5

Variants

Re SetsSemi-decidable SetsTuring-recognizable Sets

Authors

288

  1. RI
    Robert I. Soare

    University of Chicago, United States

    25 publications · 2.5K citations

    17

    h-index

  2. AH
    A. H. Lachlan

    Simon Fraser University, Canada

    15 publications · 902 citations

    14

    h-index

  3. RA
    Richard A. Shore

    Cornell University, United States

    13 publications · 366 citations

    13

    h-index

  4. KA
    Klaus Ambos‐Spies

    TU Dortmund University, Germany

    11 publications · 274 citations

    11

    h-index

  5. ML
    Manuel Lerman

    University of Connecticut, United States

    10 publications · 211 citations

    10

    h-index

1–5 of 288

Venues

  1. Journal of Symbolic Logic

    96 publications · 4.5K citations

    32

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 30 publications · 2K citations

    22

    h-index

  3. Algebra and Logic

    17 publications · 410 citations

    14

    h-index

  4. Pacific Journal of Mathematics

    12 publications · 395 citations

    12

    h-index

  5. Proceedings of the American Mathematical Society

    PROC · 18 publications · 373 citations

    12

    h-index

1–5