121 views

Are NP-Hard problems Semi decidable or Decidable or not even semidecidable?

I know NP class is decidable as there is polynomial time NTM.But in the following figure in case there are some NP hard problems that are lying outside of NP.Problems which are NP-hard but not NPC.Can these also be solved in polynomial time by NTM?

+1
NPC is decidable

$NP Hard\preceq NPC$

So, NP Hard is atmost as hard as NPC

NP hard decidable

As, Undecidable is superset of decidable

NP Hard cannot be undecidable

+1 vote

Problems which are NP-hard but not NPC.Can these also be solved in polynomial time by NTM?

Of course "NO", because then these problems will be in NP and hence NPC.

https://gatecse.in/p-np-np-complete-np-hard/