0 votes 0 votes anyone please explain this in detail Theory of Computation gateforum-test-series theory-of-computation turing-machine + – nag.swarna asked Nov 22, 2018 • edited Mar 15, 2019 by ajaysoni1924 nag.swarna 380 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Hemanth_13 commented Nov 22, 2018 reply Follow Share https://cs.stackexchange.com/questions/88282/what-is-the-difference-between-undecidable-language-and-turing-recognizable-lang But here it says " It is recognizable but not decidable." Can someone check this 0 votes 0 votes Shamim Ahmed commented Nov 22, 2018 reply Follow Share The language isn't decidable, but its recognizable. But why its not a Turing machine? Here w is a state in M, where TM might fall in a infinite loop. The language in R.E, turing machine should accept it. 0 votes 0 votes kumar.dilip commented Nov 22, 2018 reply Follow Share I think here answer will be Turing recognizable but not decidable. 0 votes 0 votes Please log in or register to add a comment.
