1. (50 points) Please prove that language FTM is undecidable using the mapping reduction method by showing ATM Sm FrM FTM = {< T > | T is a Turing machine that rejects string “homework” and loops on all other input strings 2. (50 points) Please prove that language RTM is Turing unrecognizable using the mapping reduction method by showing ATM Sm RTM, where RTM is defined below RTM = {< T > |
OR
OR