In the usual definition of probabilistic poly-time machine it is said that the machine halts in polynomial time for all inputs. Is the intention really to say that the machine halts for all inputs, or that if it halts it must be in polynomial time?
Probabilistic poly-time machine always halts on all inputs?
complexity theory;terminology;turing machines;probabilistic algorithms