Simulated Annealing

December 10, 2008 by Eliot 24 Comments

annealing

Here’s an update on our earlier post about genetic programming. Altered Qualia has posted a new implementation of [Ron Alsing]’s idea. It starts with 50 polygons and then randomly changes one parameter with each optimization step. If the the change results in fewer differences from the target image, it’s kept as the new best DNA. This search method is similar to simulated annealing. The image above is the result of 1500 good mutations out of 35900 possible. The implementation lets you choose any image, but smaller means the fitness calculation is faster. It’s written in JavaScript using the <canvas> environment. You’ll definitely get better performance using newer browser builds.

[Original image by R Stevens]

[via Waxy]

24C3 Hacking DNA

January 5, 2008 by Eliot 28 Comments

[Drew Endy]’s Programming DNA talk was by far the most interesting talk we saw at Chaos Communication Congress. No, DNA doesn’t have much to do with computers, but he points out that hacking principles can be applied just the same. Right now engineers are reversing genetic code and compiling building blocks for creating completely arbitrary organisms. This talk was designed to bootstrap the hacking community so that we can start using and contributing standard biological parts to an open source collection of genetic functions.

You should definitely watch the video to get a good idea of where biohacking is at today. You can find a higher quality version of the video in the archives.