1 1 vote {M|M is a TM that accepts all even numbers}? Theory of Computation + – Deepesh Pai 436 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Vikas Verma commented Nov 25, 2018 reply Follow flag undecidable? 0 0 replyShare Deepesh Pai commented Nov 25, 2018 reply Follow flag why 0 0 replyShare Hemanth_13 commented Nov 26, 2018 reply Follow flag How will turing machine store data in unary format right if we have huge number of 1's which are close to infinity it goes on counting we don't know when TM halts might have to wait life long :P i.e. halting problem => undecidable 0 0 replyShare Please log in or register to add a comment.
