Simple Sets
Simple Set is a recursively enumerable set whose complement is infinite but contains no infinite recursively enumerable subset, thereby distinguishing it within the class of recursively enumerable sets by exhibiting a minimal form of non-computability.
85
Publications
3K
Citations
146
Authors
103
Institutions
Publications per year
2017–2026
4
Parents
85
Klaus Ambos‐Spies, Carl G. Jockusch, Richard A. Shore et al. · Transactions of the American Mathematical Society · 1984 · 98 citations · Full text
1–5 of 85
146
4
h-index
University of Illinois Urbana-Champaign, United States
3 publications · 124 citations
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 146
103
University of Chicago
Chicago, United States
5 h-index
11 publications
595 citations

Cornell University
Ithaca, United States
4 h-index
10 publications
513 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
8 publications
173 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
106 citations

Victoria University of Wellington
Wellington, New Zealand
3 h-index
8 publications
153 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
3 publications
206 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
10 publications
508 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
5 publications
82 citations
1–8 of 103
13 publications · 392 citations
12
h-index
TRAN · 7 publications · 392 citations
7
h-index
4 publications · 123 citations
4
h-index
PROC · 3 publications · 65 citations
3
h-index
3 publications · 80 citations
3
h-index
1–5