Why Lie #5 Is Funny
I thought I'd just explain this briefly for the non-mathematicians here, so we can all join in the laugh.
The wikipedia article fitness landscape
WP gives an example of an optimization problem which can be solved by an evolutionary algorithm. The problem is:
"
A delivery truck with a number of destination addresses can take a large variety of different routes, but only very few will result in a short driving time."
This is a brief statement of what mathematicians call the Travelling Salesman Problem: we are given a number of towns (we'll call the number
n) and the distances between them. The travelling salesman wishes to visit every town on the list and return to his starting point while minimising the distance travelled.
Now the number of possible routes is the factorial of
n (written
n!) where by definition
n! = 1 x 2 x 3 x ... x (
n - 1) x
n. This grows rapidly with
n. For example, 20! = 2432902008176640000
This means that if we want to find a good route, looking at all the possible routes is not practical. As the wiki article says:
"
It is almost impossible to check all possible routes once the number of destinations grows to more than a handful."
Checking every route would be equivalent, in biology, to a creator creating life-forms by trying every possible genome and seeing which ones work. This would be wasteful and time-consuming, and so would checking every route in the Travelling Salesman problem (in computer science, such a method is known as a "brute force algorithm").
So instead of using brute force, computer scientists use an evolutionary algorithm: we simulate the process of evolution so that the "genomes" are potential routes, the "fitness" is the shortness of the route, and the "mutations" are supplied by the computer's random number generator.
As the wiki article says, evolutionary algorithms are "
particularly effective" at optimising this and similar problems when the number of routes is too large for a brute force algorithm to be effective.
---
Now, let's look at the mess kleinman's made of this.
In the first place, he thinks, for some crazy reason, that the various alternative routes correspond to selection pressures, when in fact they correspond to potential genomes.
But this blunder, though gross, pales into insignificance next to his belief that a mere
three potential routes would pose a problem for an evolutionary algorithm.
That's the stupidest statement I've ever heard anyone make about computer science. Evolutionary algorithms are, as the wikipedia article says, "
particularly effective" at solving the problem in cases where brute force algorithms are impractical ---
i.
e. in cases where there are trillions, quadrillions, or quintillions of routes.
I don't know where kleinman got his delusions on this subject from, since they have no connection with the text of the article he keeps whining about. Perhaps he hears voices in his head. If so, they're as dumb as he is.
Add to this his endless pompous bragging about how he "immediately grasped the significance" of the wiki article, and we have a recipe for Krazy Kreationist Komedy with Kleinman the Klown.