0 votes 0 votes L={ <TM>| L(TM)= not re} is it decidable or not if undecidable what specific set it belongs ? Theory of Computation theory-of-computation + – Aman Juyal asked Jan 28, 2019 Aman Juyal 295 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Aman Juyal commented Jan 28, 2019 reply Follow Share Thanks but if I modify and say L={ <TM> | L(TM)=RE} 0 votes 0 votes OneZero commented Jan 28, 2019 reply Follow Share @Somoshree Datta 5 isn't L={ <TM>| L(TM)= not re} a trivial property? None of the tuning machine satisfy the property hence trivial and by RICE's first theorem it should be decidable. means it should be recursive. 1 votes 1 votes Somoshree Datta 5 commented Jan 28, 2019 reply Follow Share oh..yes..totally missed this out.! thanks :) 0 votes 0 votes OneZero commented Jan 28, 2019 reply Follow Share @Somoshree Datta 5 L={ <TM>| L(TM)= re} is also trivial. meaning its also decidable. 0 votes 0 votes Somoshree Datta 5 commented Jan 28, 2019 reply Follow Share yes.. 0 votes 0 votes Please log in or register to add a comment.