At some point I said that GP has not succeeded in generating what we normally think of as computer programs. Recently, however, there has been some impressive work on debugging existing programs. "Automatic Program Repair with Evolutionary Computation<http://www.cs.bham.ac.uk/%7Ewbl/biblio/cache/http___www.cs.virginia.edu__weimer_p_p109-weimer.pdf>" from the May CACM reports on work that was presented at last year's GECCO. This year I heard a presentation about this paper: M. Orlov and M. Sipper, *Flight of the FINCH through the Java wilderness*<javascript:popUp('http://www.cs.bgu.ac.il/~sipper/papabs/finch-tevc.html')>, *IEEE Transactions on Evolutionary Computation*, Strangely, I can't find anything like it listed anywhere in the GECCO proceedings. The pointer is to the abstract of the paper to appear in *IEEE Transactions on Evolutionary Computation*. The full paper is apparently not available on the web.
-- Russ On Sun, Jul 11, 2010 at 7:05 AM, Russ Abbott <[email protected]> wrote: > Right. That was his work on sorting > networks<http://www.cogs.susx.ac.uk/users/inmanh/easy/alife06/PhysicaD1990-42-1-3-Hillis.pdf> > . > > > -- Russ > > > > > On Sun, Jul 11, 2010 at 10:47 AM, Russell Standish <[email protected] > > wrote: > >> On Sat, Jul 10, 2010 at 06:38:54PM -0700, Russ Abbott wrote: >> > >> > Back to the sorting questions, I'd be very interested in hearing more >> about >> > the sorting program that found a new way to sort. >> > >> > >> >> I recall Danny Hillis achieved this with a coevolutionary genetic >> algorithm back in the early '90s. I think it was published in one of >> the early ALife proceedings (probably volume 2 - the one I never >> managed to get a copy of :). >> >> Cheers >> >> -- >> >> >> ---------------------------------------------------------------------------- >> Prof Russell Standish Phone 0425 253119 (mobile) >> Mathematics >> UNSW SYDNEY 2052 [email protected] >> Australia http://www.hpcoders.com.au >> >> ---------------------------------------------------------------------------- >> > >
============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org
