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
270
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
A note on the Entscheidungsproblem
Alonzo Church · Journal of Symbolic Logic · 1936 · 797 citations
1–5 of 270
219
15
h-index
13
h-index
13
h-index
11
h-index
10
h-index
1–5 of 219
140
University of Chicago
Chicago, United States
17 h-index
34 publications
2.7K citations

Cornell University
Ithaca, United States
15 h-index
26 publications
1.2K citations
University of California, Berkeley
Berkeley, United States
12 h-index
14 publications
672 citations
University of Connecticut
Storrs, United States
9 h-index
9 publications
225 citations

University of Leeds
Leeds, United Kingdom
8 h-index
8 publications
277 citations
TU Dortmund University
Dortmund, Germany
8 h-index
14 publications
558 citations
University of Illinois Chicago
Chicago, United States
7 h-index
7 publications
132 citations

Victoria University of Wellington
Wellington, New Zealand
7 h-index
11 publications
229 citations
1–8 of 140
80 publications · 3.9K citations
28
h-index
TRAN · 26 publications · 1.9K citations
18
h-index
12 publications · 259 citations
11
h-index
13 publications · 392 citations
11
h-index
PROC · 14 publications · 221 citations
11
h-index
1–5