Return to Revisions

3 of 3

edited tags

edited Jan 8, 2012 at 20:00

Is there constructive proof of the fact that every recursive set $A \ne \varnothing$ is recursively enumerable in non-decreasing order?

Every proof I've read about this fact considers two cases: $A$ - finite and $A$ - infinite but this is undecidable problem. So, is there constructive proof?

computer-science lo.logic

asked Jan 8, 2012 at 16:50

John Rice