New answers tagged

-1

The answer is (trivially) yes. Any non-decidable language provides a decision problem that is harder than anything in NP.


Top 50 recent answers are included