Post problem
= Post problem
{c}
Post problem asks whether a <computably enumerable set> can have a <Turing degree> strictly between the computable degree and the degree of the <halting problem>. The <Friedberg–Muchnik theorem> answers yes by constructing two incomparable computably enumerable degrees.