The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behavior of evolutionary algorithms with nite search spaces and discrete time scale. Results on evolutionary algorithms beyond nite space and discrete time are also presented but with reduced elaboration.