Problem
Read and understand Theorem 5.1 HALTTM is undecidable (given on page 202, 3rd edition of the textbook) and its proof (given on pages 216-217). Answer the following questions: (i) What are the three Turing machines R, S, and M for? (ii) What does it mean when S accepts? What about when R accepts? How about M accepts?