i know its probebly not the easiest way to prove it, but
if i want to show a reduction from every L in NP to Htm,
can i use the fact that L is in NP, and have a TM M that decide it (even if its non deterministic)
to create a machine then will stop or loop acording to if M accept w (the reduction itself only build <M',w> from <M,w> and does not run it so is polynomial time right?)
is it right or have i made a wrong asumption somwhere..