<div dir="ltr">Hi all,<div><br></div><div>This is just a reminder of tomorrow's seminar, which will take place as usual from 2pm to 3pm in mb220 and will see <span style="font-size:12.8px">Dr. William Langdon (</span><a href="http://www0.cs.ucl.ac.uk/staff/W.Langdon/" target="_blank" style="font-size:12.8px">http://www0.cs.ucl.ac.uk/staf<wbr>f/W.Langdon/</a><span style="font-size:12.8px">) giving a talk on "Long-Term Evolution in Genetic Programming".</span></div><div><span style="font-size:12.8px"><br></span></div><div><span style="font-size:12.8px">Best,</span></div><div><span style="font-size:12.8px">Luca</span></div></div><div class="gmail_extra"><br><div class="gmail_quote">On 28 February 2017 at 11:59, Luca Rossi <span dir="ltr"><<a href="mailto:l.rossi@aston.ac.uk" target="_blank">l.rossi@aston.ac.uk</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">Dear all,<div><br></div><div>Next Tuesday (07/03) Dr. William Langdon (<a href="http://www0.cs.ucl.ac.uk/staff/W.Langdon/" target="_blank">http://www0.cs.ucl.ac.uk/staf<wbr>f/W.Langdon/</a>) will give a talk titled "Long-Term Evolution in Genetic Programming" in MB220 from 2pm to 3pm.</div><div><br></div><div>Looking forward to seeing you there,</div><div>Luca</div><div><br></div><div>Abstract: </div><div><br></div><div>We evolve 6-mux populations of genetic programming binary Boolean trees for up to 100,000 generations. As there is no bloat control, programs with more than a hundred million nodes may be created by crossover. These are by far the largest programs yet evolved. Our unbounded Long-Term Evolution Experiment LTEE GP appears not to evolve building blocks but does suggests a limit to bloat.</div><div><br></div><div>We do see periods of tens even hundreds of generations where the whole population is functionally converged. In contrast to wetware LTEE experiments with bacteria (genome 4.6 million base pairs in length and 66000 generations), we do not see continual innovation, but instead although each tree in the population may be different, they all have the same phenotype (in that they can all solve the multiplexor benchmark) and the code next to the tree's root becomes highly stable.</div><div><br></div><div>We test theory about the distribution of tree sizes. Surprisingly in real finite populations with typical GP tournament selection we do see deviations from crossover only theoretical predictions.<span class="HOEnZb"><font color="#888888"><br clear="all"><div><br></div>-- <br><div class="m_-6848030837193854267gmail-m_448176701923098077gmail_signature"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div dir="ltr"><div dir="ltr">Luca Rossi</div><div dir="ltr"><br></div><div dir="ltr">Lecturer in Computer Science</div><div dir="ltr">School of Engineering and Applied Science</div><div dir="ltr">Aston University</div><div dir="ltr">Web: <a href="http://www.cs.bham.ac.uk/~rossil/" target="_blank">http://www.cs.aston.ac.uk<wbr>/~rossil/</a></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div>
</font></span></div></div>
</blockquote></div><br><br clear="all"><div><br></div>-- <br><div class="gmail_signature" data-smartmail="gmail_signature"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div dir="ltr"><div dir="ltr">Luca Rossi</div><div dir="ltr"><br></div><div dir="ltr">Lecturer in Computer Science</div><div dir="ltr">School of Engineering and Applied Science</div><div dir="ltr">Aston University</div><div dir="ltr">Web: <a href="http://www.cs.bham.ac.uk/~rossil/" target="_blank">http://www.cs.aston.ac.uk/~rossil/</a></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div>
</div>