Enumerability is a formal property in computability theory denoting the capacity of a set to be systematically listed by a Turing machine, such that each element of the set eventually appears in the sequence, distinguishing it from decidable or recursive sets by allowing infinite or non-terminating enumeration procedures.
250
Publications
11.4K
Citations
281
Authors
172
Institutions
Publications per year
2017–2026
11
Parents
Publications
250
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
Algebraic languages and polyominoes enumeration
M. Delest, Gérard Viennot · Theoretical Computer Science · 1984 · 328 citations
1–5 of 250
Authors
281
- RI
13
h-index
- TA
11
h-index
- SL
10
h-index
- AH
9
h-index
- SB
9
h-index
1–5 of 281
Institutions
172
University of Chicago
Chicago, United States
16 h-index
26 publications
2.1K citations
University of California, Berkeley
Berkeley, United States
14 h-index
16 publications
484 citations
Victoria University of Wellington
Wellington, New Zealand
11 h-index
14 publications
291 citations
University of Wisconsin–Madison
Madison, United States
11 h-index
16 publications
496 citations
University of Leeds
Leeds, United Kingdom
11 h-index
19 publications
516 citations
University of Connecticut
Storrs, United States
9 h-index
9 publications
300 citations
Cornell University
Ithaca, United States
7 h-index
8 publications
253 citations
University of Waterloo
Waterloo, Canada
6 h-index
9 publications
308 citations
1–8 of 172
Venues
- Journal of Symbolic Logic
54 publications · 2K citations
24
h-index
- Theoretical Computer Science
12 publications · 695 citations
12
h-index
- Algebra and Logic
13 publications · 382 citations
12
h-index
- Annals of Pure and Applied Logic
14 publications · 412 citations
11
h-index
- Transactions of the American Mathematical Society
TRAN · 11 publications · 1.2K citations
10
h-index
1–5