Evolving Bugless Programs Through Simulated Evolution

A brief and nice overview of a genetic programming application for debugging real computer code programs. See it here.

It's almost a surprise to me the programming language used was the good old C: A Real Programming Language Hero!

Predicting Collapsing Companies Through Simulated Evolution

Our blog friend Juan Julián Merelo Guervós has made a post on predicting variables playing major roles on which company is going to close its doors. His group applied genetic programming and self-organizing maps  for predicting that.

In an environment full of uncertanties and noisy as financial market and economic-related areas are, it may be an useful tool for all those worried about where their invested money is going after all.

Have our blog friend finally discovered the so feared Doomsday Device? If so, please, reserve my ten females of highly stimulating nature... Since outside it will be nothing to do at all... :)

Будет ласковый дождь

The New Blog On The Block!!

Another pointer from our Illigal blog friends: Professor Lee Spector has got a blog. He is the editor of Genetic Programming and Evolvable Machines.

It's interesting an editor owning a blog! So, let's welcome him to the evolutionary computation blogosphere.

Evolving Mona Lisa Through Simulated Evolution

Amazing story this one! See it here.

It is a genetic programming algorithm designed to evolve Leonardo Da Vinci's Mona Lisa. It seems that each individual is represented by 50 polygons and the fitness function is the real image of Mona Lisa. So, the polygons should be arranged as close as possible to the real one.

The final result is amazing.

EvoWeb Interviews John Koza

Check his interview here.

I have not been aware that John Koza was John Holland's student along the 1960s.

Interesting interview, despite my own disagreements on some points.

Koza summarizes his path towards genetic programming (GP), the choice for LISP as the main computer language of early GP implementations, the initial papers, the hostility from the GA community at that time (early 1990s), his practitioner style, his achievements, the 1000 nodes computer cluster at Stanford, and so on.

The interview is from 1998.

:.::.::.::.::.::.::.::.::.::.::.::.::.::.:

P.S: There is someone that extremely disagrees upon Koza's statements.

:.::.::.::.::.::.::.::.::.::.::.::.::.::.:

Evolutionary Computation Researcher In Antarctica Has Found The Best Time Complexity Evolutionary Algorithm

My news webservice has brought to me the following evolutionary computation findings:

"An international mission based in Antarctica in a special lab has found the best time complexity evolutionary algorithm ever! Professor Pangloss Van Thunder-ten-Tronckh is the director of the project, which began along the late 1970s and had the former U.S.S.R. as the main manager beside U.S.A - Professor Trollov Buraninev is the director of the U.S.S.R. part. 'It is a finding that will open the doors of a new kind of science among all other sciences', said Professor Pangloss. He continues: 'This discovery is to evolutionary computation as the calculus was to physics and mathematics.'

Professor Pangloss states that his team was the first to solve an over a billion variables problems and they did it using just an AMIGA 500. He comments: 'Although some guys from Urbana-Champaign have claimed that they are the first ones, it is not true! As we are funded by CIA and the former KGB, our results never made the big mainstream publication magazines!'.

He claims he was the inventor of the Estimation of Distribution Algorithms (EDA): 'What outside Antarctica evolutionary computation researchers call EDA, was invented by me when I was an undergrad student during the 1950s! It was a homework that my advisor gave me.'

He also said that what Professor Hans-Georg Beyer has made upon the theory of evolution strategies is, indeed, a less elegant version of what Professor Buraninev's team had already done in 1981. Professor Buraninev states: 'I know very well the work of those German guys! Of course, it is just a lower quality flavour of my own research that I started in April 1st, 1977. What Professor Beyer has made is valid only under certain conditions, that is, Gaussian mutation, intermediate recombination, and comma/truncation selection - let alone that my self-adaptation mechanism is much more general than Schwefel's and/or Rechenberg's, since it can adapt to any kind of fitness/objective function! We made a complete theory of evolution strategies under all imaginable conditions, taking into account correlations, covariances, discrete recombination, noise, plus selection, comma selection, Gaussian mutation, Cauchy mutation, Gamma mutation, Geometric mutation, Bernoulli mutation, Poison mutation, Laplace mutation, uniform mutation, Zipf-Mandelbrot mutation, Student mutation, and so on... both univariate and multivariate distributions! And I did it in my special built Agat computer! And... remember: In Soviet Russia genetic algorithms rotate... YOU!!!'

Professor Pangloss comments about a strange guy that once entered his iglu: 'Yes... he was very strange! He stayed here for almost two weeks and he worn every single day only striped shirts! He promised me that he would teach us how to always win when betting in lottery. I thought him a nice guy and showed him my new invention - Programs that generates, through simulated evolution, others programs! I gave him a source code in LISP! To my very own desperation, years later I was told that he had invented an invention machine and was using my code on it!'

Professor Buraninev once met a Californian guy from La Jolla: 'Yes! That guy once told me that he would introduce me to a friend of his, her name was Blondie24. At a first glance, I thought her name a little strange, since girls do not use to put numbers on their names. But he stated that that was a new Western fad and that the girl was a true master in checkers. Oh, heavens! I would finally realize my Soviet Nerd dream: Date a girl which also is a checkers master! Then, he fixed a day for a meeting. I believed... how fool I was! While the girl, the so-called Blondie24, had not arrived, he showed me some of his father's work on automata. I decided to show him my new evolutionary algorithm flavour which is almost the same as evolution strategies, except on the selection mechanism and the self-adaptation procedure. The guy went insane! He immediately ran away from the Iglu Cafe! Some years later, I got aware that he was engaged in a new business endeavour and using my mind child!! The girl, Blondie24, has never appeared!'

Well, despite all those confusions along the years, Professor Pangloss is really happy to announce the ultimate finding of his lab team. He says: 'Finally, after 30 years of research, we are able to declare that we have found an evolutionary algorithm whose complexity is only O(n^-100-100)! This is the complexity of our algorithm in ALL classes of problems! Both decomposable - the easy ones! - and non-decomposable!!' So, where is such a poweful evolutionary algorithm? Professor Pangloss explains: 'Since we have been fooled by those guys from mainstream academia, we will not show how our procedure works! It is even impossible to rescue its inner working, because this was written on a sheet of ice that Professor Buraninev applied on his vodka research!'

But... what about computer codes and simulations? Again, Professor Pangloss has an explanation: 'Our codes, simulations, and computers were all eaten out by a blue whale! This animal is very common by this side of the world and even ate my favourite grad student!'

It seems that evolutionary computation will need to wait a little more to be completely formalized and put on formal grounds!"