0 votes 0 votes Consider the language L Where the symbol refers to polynomial time reducible. Comment on the decidability of the above language? Aditya Bahuguna asked Dec 1, 2017 Aditya Bahuguna 208 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply sumit chakraborty commented Dec 1, 2017 reply Follow Share Seems you forgot the language. 0 votes 0 votes Tesla! commented Dec 1, 2017 reply Follow Share May be L= phi ? 1 votes 1 votes Please log in or register to add a comment.