AG Algorithmen und Komplexität

Nature Inspired Computing

Looking around nature reveals numerous examples for structures that solve complicated problems seemingly automatically, for instance insect wings, formation flying of geese and columns of ants. Classic engineering disciplines have been drawing on natural examples for centuries. The obvious question is whether imitating processes in nature with algorithms is worthwhile, too.

In the first part of this lecture, we follow the history of evolutionary algorithms. Using simple examples, we formally investigate whether evolutionary algorithms can be of use or are even universal weapons.

After that, we try to solve algorithmic problems by exploiting the massive parallelism recombination of DNA and RNA offers. Is the test-tube computer near?

It is currently unknown when we will offer this course again. It is a 4 ECTS advanced-level master course; find details in the official documents.