Saturday 20 October 2007

Next NAME/Alergic: Chris Watkins, Wed 24th Oct, ARUN401

The next NAME meeting is a combined NAME/Alergic event. Chris Watkins, Royal Holloway, will be talking about his research into information theoretic approaches to evolution and in particular the 'channel capacity' of evolution. Please see abstract below.

16:30, Wednesday 24th October
Arundel room 401

All welcome.



Abstract

This talk will consider some familiar genetic and evolutionary algorithms from a new point of view. Instead of viewing these algorithms as optimisation methods, I will consider them information-theoretically, as communication channels. After a brief introduction to Shannon's theory of communication, I will show how to view an evolutionary algorithm as a communication channel, and then show that different algorithms have very different channel capacities.
Intuitively, the channel capacity of an evolutionary algorithm is a measure of how much information -- or how much complexity -- can be put into the "genomes" as a result of selection. This seems a basic limitative computational property, which may be relevant to choosing useful regimes to get evolutionary algorithms to work effectively.
In biological evolution, in each generation genetic information is degraded by mutation, but also in some sense restored by selection. Some natural basic questions are: How much information could be encoded in a genome as a result of selection? How complex could organisms conceivably become? Does the potential complexity depend on whether the organisms are sexual? How could information be encoded most efficiently, in the sense that the greatest amount could be encoded for the lowest intensity of selection? The theoretical approach I will present may have some bearing on these questions.



New Approaches to Modelling Evolution/Ecosystems

http://newapproaches.blogspot.com

2 comments:

Anonymous said...

I’m not that much of a internet reader to be honest but your sites really nice, keep it up!
I'll go ahead and bookmark your website to come back later. Cheers

Here is my web-site; airplane landing games
My web page > airplane flying games

Anonymous said...

This paragraph will help the іntеrnеt
viewеrѕ foг creating new weblog οr eѵen а weblοg fгom stаrt
to еnd.

Feel free to vіsіt my web-sitе; diamondlinks review