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...
2026-04-09 00:22:36.1775694156
RE problems that are neither RE-complete nor recursive
70 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
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.