0 votes 0 votes Can someone explain this problem? Theory of Computation ace-test-series theory-of-computation decidability + – Kalpataru Bose asked Sep 4, 2018 • edited Mar 3, 2019 by I_am_winner Kalpataru Bose 593 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments MiNiPanda commented Sep 4, 2018 reply Follow Share BASANT KUMAR Information like input symbols, states,tape symbols are all included in the TM encoding. So to check if TM has less than 15 states or not we just need to check the encoding. 1 votes 1 votes manisha11 commented Sep 4, 2018 reply Follow Share If visiting a state problem will be decidable then the halting problem too will be decidable, which isn't true. Answer should be A 0 votes 0 votes Deepak Poonia commented Sep 5, 2018 reply Follow Share Because of $"can" visit $, $L_2$ is Decidable. If it was $"Visits \,\, or \,\, will \,\,visit"$, $L_2$ is State-entry problem and hence, Undecidable. Only Ace can make a worthless question like this. 4 votes 4 votes Please log in or register to add a comment.
