Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

As stated, is there any decision problems in the complexity class RE that are neither RE-complete nor recursive?

It seems that almost all of nonrecursive RE problems are in RE-complete...

share|cite|improve this question
up vote 3 down vote accepted

This is known as Post's problem and the answer is yes. The first such problem (and the only one I am familiar with) was constructed using forcing and the method of finite injury.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.