TOC QUESTION

Question

Which of the following is not true?

A)Class of All languages is not countable

B)Every language in P is also in NP

C)Every language in NP is decidabale.

D)There are some languages in NP but not in P

Answer 1

• Class of All languages is not countable is True  
• Every language in P is also in NP is true since P is subset of NP
• Every language in NP is decidabale is Ture  either by DTM or NTM .
• There are some languages in NP but not in P is true.

Comments

yes it was uncountable .

---

Then which one is answer

---

No option is correct

Answer 2

Option C i think

Comments

I don't think so actually i have little bit confusion over this as i read somewhere that every np is decidabale so confused between obtion C and D.

Answer 3

All are true.

1) Set of all languages is Uncountably infinite.

2) Every P is NP , we all know this all.

3) For every NP there is some Deterministic Turing Machine that can solve that in Exponential time. so NP class problems are decidable.

4)Every P is NP but vice versa not true.