Re: Simulated Evolution

That's more or less the same question I asked myself back during Sophmore year in High School, when I was taking my bio class. I wandered into the field of genetic programming; and being a Perl nut even at that tender young age, I wrote myself a Perl library to do it (the first GP library written in Perl, so far as I know) The end result can be found at Perls of evolution. Genetic programming or breeding perls also addresses a similar topic; though not GP according to the canonical sense, there is no way to deny that one is genetically evolving programs. Check both of 'em out.

ObLink to the papers I wrote. Feel free to drop me a line if you're curious and/or want to know more. I found Koza's book to be rather useful, myself.

perl -pe '"I lo*`+$^X$\"$]!$/"=~m%(.*)%s;$_=$1;y^`+*^e v^#$&V"+@( NO CARRIER'

Comment on Re: Simulated Evolution

Replies are listed 'Best First'.
Re: Re: Simulated Evolution by bsb (Priest) on Dec 16, 2001 at 20:20 UTC
Koza uses Lisp though right? And breeds the parse trees directly to produce other programs. I don't think you can do that with Perl, perhaps with some B::* module Of course you can play with program text and eval for the same effect.	[reply]
Re: Re: Re: Simulated Evolution by Chmrr (Vicar) on Dec 16, 2001 at 20:52 UTC
That is correct -- Koza does breed actual Lisp S-expressions. I would submit that what he was doing with Lisp is equivilent to playing with "program text and eval" in any other language, such as Perl. Which, incidentally, is what I did. So I can tell you with great certainty that it does indeed work. :) I did look into using the B:: series of modules, but from what I could see, they were lower-level than would be useful -- dealing with opcodes, not expressions. Of course, if anyone knows more about the B:: modules and can educate me, I'm all ears. perl -pe '"I lo`+$^X$\"$]!$/"=~m%(.)%s;$_=$1;y^`+*^e v^#$&V"+@( NO CARRIER'	[reply]