Complexity Theory and Genetics (extended abstract)

. We introduce a population genetics model in which the operators areeffectively computable -- computable in polynomial time on Probabilistic TuringMachines. We shall show that in this model a population can encode easily largeamount of information from enviroment into genetic code. Then it can processthe information as a paralel computer. More precisely, we show that it can simulatepolynomial space computations in polynomially many steps, even if therecombination rules are very simple....