Original: The usual definition of a Las Vegas algorithm includes the restriction that the expected run time always be finite , when the expectation is carried out over the space of random information , or entropy , used in the algorithm .
Simplified: It may take a very long times to give back a result , or it may not give back a result at all .