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
Parents
337
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
Recursive Unsolvability of a problem of Thue
Emil L. Post · Journal of Symbolic Logic · 1947 · 533 citations
An introduction to formal language theory
Choice Reviews Online · 1989 · 471 citations
1–5 of 337
288
17
h-index
14
h-index
13
h-index
11
h-index
10
h-index
1–5 of 288
178
University of Chicago
Chicago, United States
18 h-index
35 publications
2.8K citations

Cornell University
Ithaca, United States
13 h-index
24 publications
1.1K citations
University of California, Berkeley
Berkeley, United States
12 h-index
17 publications
691 citations

Victoria University of Wellington
Wellington, New Zealand
10 h-index
14 publications
284 citations
University of Connecticut
Storrs, United States
9 h-index
9 publications
214 citations
University of Illinois Chicago
Chicago, United States
8 h-index
8 publications
167 citations
TU Dortmund University
Dortmund, Germany
7 h-index
13 publications
537 citations
National University of Singapore
Singapore, Singapore
7 h-index
7 publications
139 citations
1–8 of 178
96 publications · 4.5K citations
32
h-index
TRAN · 30 publications · 2K citations
22
h-index
17 publications · 410 citations
14
h-index
12 publications · 395 citations
12
h-index
PROC · 18 publications · 373 citations
12
h-index
1–5