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

Authors

38

  1. VH
    Vesa Halava

    University of Turku, Finland

    3 publications · 64 citations

    3

    h-index

  2. RI
    Robert I. Soare

    University of Chicago, United States

    3 publications · 98 citations

    3

    h-index

  3. WE
    W. E. Singletary

    Pennsylvania State University, United States

    3 publications · 37 citations

    3

    h-index

  4. GE
    Gerald E. Sacks

    Massachusetts Institute of Technology, United States

    3 publications · 94 citations

    3

    h-index

  5. TH
    Tero Harju

    University of Turku, Finland

    3 publications · 116 citations

    3

    h-index

1–5 of 38

Venues

  1. Journal of Symbolic Logic

    6 publications · 158 citations

    6

    h-index

  2. Bulletin of the American Mathematical Society

    3 publications · 96 citations

    3

    h-index

  3. International Journal of Algebra and Computation

    IJAC · 2 publications · 84 citations

    2

    h-index

  4. Annals of Mathematics

    2 publications · 786 citations

    2

    h-index

  5. Transactions of the American Mathematical Society

    TRAN · 2 publications · 75 citations

    2

    h-index

1–5