Post's Problem
Post's Problem is a fundamental question in recursion theory that asks whether there exists a recursively enumerable set whose Turing degree is strictly intermediate between the computable sets and the halting problem.
29
Publications
1.5K
Citations
38
Authors
26
Institutions
Publications per year
2017–2026
1
Parents
29
The Word Problem in Semi-Groups With Cancellation
Alan Turing · Annals of Mathematics · 1950 · 76 citations
Piergiorgio Odifreddi · Bulletin of the American Mathematical Society · 1981 · 63 citations · Full text
1–5 of 29
38
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 38
26

University of Turku
Turku, Finland
3 h-index
8 publications
277 citations
University of Illinois System
Urbana, United States
2 h-index
2 publications
24 citations
TU Dortmund University
Dortmund, Germany
2 h-index
2 publications
45 citations
Turku Centre for Computer Science
Turku, Finland
2 h-index
4 publications
90 citations
University of Illinois Chicago
Chicago, United States
2 h-index
2 publications
45 citations
University of California, Berkeley
Berkeley, United States
2 h-index
3 publications
122 citations
University of Connecticut
Storrs, United States
2 h-index
2 publications
45 citations
Beijing Institute of Radio Metrology and Measurement
Beijing, China
1 h-index
3 publications
30 citations
1–8 of 26
6 publications · 158 citations
6
h-index
3 publications · 96 citations
3
h-index
IJAC · 2 publications · 84 citations
2
h-index
2 publications · 786 citations
2
h-index
TRAN · 2 publications · 75 citations
2
h-index
1–5