So, this question is taken from here
https://gateoverflow.in/151057/langle-rangle-there-exist-input-whose-length-than-which-halts%24
$L=\{<M>| $M is a Turing machine and there exists an input whose length is less than 100 on which M halts$\}$
I got to know that for semi-decidability, since we have finite number of strings of length less than 100, for all such strings, we run TM in interleaved mode and if for any input TM halts, we say Yes.But my question is, for how long will we wait?
Suppose TM may take too long before it says yes, can we be sure whether we are really reaching an answer or TM has got into infinite loop?