Turing Machines Proving Undecidability Show Following Two Languages Undecidable Use Reduct Q24986442

Turing Machines: Proving Undecidability

Show that the following two languages are both undecidable (usereduction)

a) A = { | M is a Turing Machine. If M accepts ‘aab’, then Maccepts ‘baa’.}

b) B = { <M> | M is a Turing Machine that moves left whenthe head is positioned three cells to the left of the first cellcontaining some input string x}

0 replies

Leave a Reply

Want to join the discussion?
Feel free to contribute!

Leave a Reply

Your email address will not be published. Required fields are marked *