1 1 vote For every deterministic Turing machine, there exists an equivalent deterministic Non Deterministic Turing machine. I know, other way is correct i.e for every DTM there exist a NDTM, but is above TRUE/FALSE. Thank you! Theory of Computation turing-machine theory-of-computation recursive-and-recursively-enumerable-languages decidability self-doubt + – iarnav 1.4k views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Anu007 commented Nov 1, 2017 reply Follow flag Power of DTM is same as the power of NDTM . What you ask is trivially true. 0 0 replyShare iarnav commented Nov 1, 2017 reply Follow flag Thanks! 0 0 replyShare Manu Thakur commented Nov 1, 2017 i edited Nov 1, 2017 reply Follow flag "deterministic Non Deterministic Turing machine" what does this mean? Either TM is deterministic or non-deterministic, right? 0 0 replyShare iarnav commented Nov 1, 2017 reply Follow flag yes, my bad! 0 0 replyShare Please log in or register to add a comment.
0 0 votes i think it wont happen becz DTM and NDTM hae equal in power suryaprakash answered Feb 23, 2018 suryaprakash comment Share Follow 0 reply Please log in or register to add a comment.
