This is a practice question I have, but I can't wrap my head around it. ............. Let L = {M | M is a TM that halts with exactly two words on its tape in the form Bw1Bw2B}. B = Blank Position

the problem of deciding whether an arbitrary Turing machine will accept an arbitrary input, is undecidable. Use this result to prove, formally using problem reduction, that given an arbitrary Turing machine M, the problem of deciding if M ∈ L is undecidable. ............ I have no knowledge of proofs. I don't have a clue how to tackle this question, can someone point me to a tutorial that works with proofs by reduction along with Turing machines.

  • $\begingroup$ First and Second links from google $\endgroup$ – diplodoc Sep 11 '19 at 10:47
  • 2
    $\begingroup$ If you have no knowledge of proofs, computability theory is not the perfect place to start. $\endgroup$ – Yuval Filmus Sep 11 '19 at 12:15