1 1 vote Theory of Computation + – Deepesh Pai 480 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Utkarsh Joshi commented Nov 25, 2018 reply Follow flag For 1, You have to run M for the input 'x' for 'k' steps. After 'k' steps if the machine has not stopped, you will accept such input else reject so decidable. For 2, All TM's accept RE languages hence L is the empty set. decidable. 2 2 replyShare Hemanth_13 commented Nov 26, 2018 reply Follow flag Brother can you elaborate on 2nd part please 0 0 replyShare Utkarsh Joshi commented Nov 26, 2018 reply Follow flag All Turing machines accepts Recursively Enumerable Languages. So, there is no machine which does not accept turing recognizable language hence L is an empty set. 0 0 replyShare Hemanth_13 commented Nov 26, 2018 reply Follow flag But turing machine is not capable of accepting$\epsilon$ right Then isn't it undecidable?? 0 0 replyShare Please log in or register to add a comment.
