2 votes 2 votes CONSIDER THE FLLOWING LANGUAGE L={<M>| M is a TM and L(M)=empty} Which of the following is true? a- Decidable REC B- Undecidable and RE c-Undecidable and non RE d- Decidable but RE Theory of Computation decidability theory-of-computation recursive-and-recursively-enumerable-languages + – bts1jimin asked Jan 8, 2019 bts1jimin 610 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments bts1jimin commented Jan 9, 2019 reply Follow Share Yes, but I dont understand why According to wikipedia, minima is minimum value of the function. See- https://en.wikipedia.org/wiki/Maxima_and_minima 0 votes 0 votes Shobhit Joshi commented Jan 9, 2019 reply Follow Share normally we consider local unless stated explicitly 0 votes 0 votes bts1jimin commented Jan 9, 2019 reply Follow Share Yes but my questiom here is, according to wikipedia minima is function's minimum value, not the points where minimum is achieved , in this question minimum value of function is 0 that is only 1 minima(at -3,+3).....but the answer is 2 minima 0 votes 0 votes Please log in or register to add a comment.