301 views
0 votes
0 votes
If a problem A is reducable to problem B and it is known that B is undecidable then is A undecidable?

1 Answer

0 votes
0 votes
The answer is True because if we reduce the instance of the problem of class A  into class B in polynomial time then A and B belong to same class.