we were asked in homework 6, question 4 to prove that HTM is in NP-hard.
I read the reduction suggested in the solutions, but still wanted to know if my idea for a reduction is OK -
The reductionis from Bounded ATM to HTM-
f:<M,w,1^k> ——> <M',w>
M' will run M on w for k steps:
if M accepts, M' will accept too. if not, M' will get into a new state, Qnew, and will stay in a loop forever in Qnew.
Is that ok?