Recursive Enumerability

Recursive Enumerability is a formal property of a set of natural numbers that belongs to the class of computably enumerable sets, distinguished by the existence of a Turing machine that systematically lists all elements of the set, thereby enabling the set to be recursively generated even if not necessarily decidable.

270

Publications

13.9K

Citations

219

Authors

140

Institutions

Publications per year

2017–2026

3

Authors

219

  1. RI
    Robert I. Soare

    University of Chicago, United States

    21 publications · 2.3K citations

    15

    h-index

  2. RA
    Richard A. Shore

    Cornell University, United States

    16 publications · 457 citations

    13

    h-index

  3. AH
    A. H. Lachlan

    Simon Fraser University, Canada

    13 publications · 840 citations

    13

    h-index

  4. KA
    Klaus Ambos‐Spies

    TU Dortmund University, Germany

    13 publications · 311 citations

    11

    h-index

  5. TA
    Theodore A. Slaman

    University of California, Berkeley, United States

    10 publications · 359 citations

    10

    h-index

1–5 of 219

Venues

  1. Journal of Symbolic Logic

    80 publications · 3.9K citations

    28

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 26 publications · 1.9K citations

    18

    h-index

  3. Algebra and Logic

    12 publications · 259 citations

    11

    h-index

  4. Theoretical Computer Science

    13 publications · 392 citations

    11

    h-index

  5. Proceedings of the American Mathematical Society

    PROC · 14 publications · 221 citations

    11

    h-index

1–5