0 votes 0 votes Theory of Computation theory-of-computation + – rajoramanoj asked Sep 23, 2017 rajoramanoj 349 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Manu Thakur commented Sep 23, 2017 reply Follow Share If an unknown problem x is polynomial time reducible to a decidable problem y, then problem x is also decidable, because every time we can reduce unknown problem to decidable problem and can indirectly solve it, In my opinion, correct option should be (b) as $0^p 1^{2p}$ is a decidable problem. 0 votes 0 votes rajoramanoj commented Sep 23, 2017 reply Follow Share @manu00x i am also say B but ans A is given in made-easy test solution 0 votes 0 votes Manu Thakur commented Sep 23, 2017 reply Follow Share post the given Solution here. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes A: Undecidable From Rice theorem and Reduction concept Ranjan Kr Deka answered Sep 23, 2017 Ranjan Kr Deka comment Share Follow See 1 comment See all 1 1 comment reply rajoramanoj commented Sep 24, 2017 reply Follow Share plz explain in detail.... 0 votes 0 votes Please log in or register to add a comment.