Wait, I thought there were no intermediate Turing degrees below the halting problem (which is in degree 0').
Undecidable problem from programming:
- Whether a given grammar is context free (?)
|
1 | [made Community Wiki] | ||
|
|
||||
