I am trying to show that this is Turing Recognizable.
The language A, that is a DTM, T, that halts on a minimum of one input.
My justification is that of course it is because, you just need to check if an accept state is reachable. However, this seems like I am making it trivial.
Is there something larger I am missing?
EDIT: New Idea
Let M be a DTM that does this:
For every string w in the language, simulate w on T. if it halts, accept.
The only problem I see with this, is if a string causes it to loop forever, then it will never try the others.