The usual definition of a Las Vegas algorithm includes the restriction that the "expected" runtime be finite, where the expectation is carried out over the space of random information, or entropy, used in the algorithm.