0 votes 0 votes Consider the following language: $L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings } Which of the following is true about L? A)L is decidable B)L is Turing recognizable C)L is not recursive D)None of these Theory of Computation theory-of-computation test-series identify-class-language multiple-selects + – Pranavpurkar asked Nov 16, 2022 Pranavpurkar 409 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Pranavpurkar commented Nov 23, 2022 reply Follow Share no it’s a non trivial property , you can refer, https://gatecse.in/rices-theorem/ 0 votes 0 votes MANSI_SOMANI commented Nov 23, 2022 reply Follow Share @Pranavpurkar Got it Thanks for sharing! We can conclude this question from the link u sended as it's undecidable but it's turing recognizable right?? 0 votes 0 votes Pranavpurkar commented Nov 23, 2022 reply Follow Share Yes . 1 votes 1 votes Please log in or register to add a comment.