Mr. Scott
Under the Amazing One's Wing
- Joined
- Nov 23, 2005
- Messages
- 2,546
A single selection condition can be sorted for very rapidly by Dr Schneider’s sorting algorithm while all three selection conditions can only be sorted for rapidly only on extremely tiny unrealistic length genomes. This mathematical behavior that Dr Schneider’s mathematical model demonstrates is reflected in reality as demonstrated by more of these real examples of the mutation and selection sorting/optimization process.
Dr. Kleinman, I’m glad you brought this up because I am prepared to drive a silver spike through the heart of that argument.
Your error has to do with your equation of model execution time with the virtual time that it is modeling.
Nature does not execute a sort algorithm. The time it takes to sort a population in a computer in no way models the time needed to sort a population in nature. Organisms in a natural colony sort themselves instantaneously, whereas a computer model, by the nature of the usual computer program implementation, must execute an algorithm sequentially, and necessarily needs more CPU time as the number of items or selection conditions increases.
A computer program has to execute one instruction at a time, with a single CPU sequentially going through a sort algorithm step by step, item by item, and condition by condition. In nature, though, each organism has, in a sense, it’s own CPU, so a sort happens with massive parallelism. A colony of a trillion microbes has, in effect, a trillion processors running a trillion sorts all at the same time, and the number of conditions (selection pressures) would have no effect on the real time sort speed.
I’ll give you an example of how this works. Suppose a photographer needs one hundred students to line up for a photograph sorted by height. If the photographer were to make each comparison himself and order each swap himself and wait for each swap to occur before making the next comparison, it would take a very long time indeed for the hundred students to be sorted. Alternatively, the photographer could give the students the following instruction: “everyone please position yourself so that you have a taller person to your right and a shorter person to your left” and the students would sort themselves very, very quickly.
The first example is how Ev sorts -- laboriously, one comparison and swap at a time. The second example is how nature sorts -- every organism sorts itself, by reproducing or not reproducing according to how competition plays out, and the count of sort conditions would have no affect on the speed of that sort -- some die, some don't. No sort time is required.
In summary, though a condition (selection pressure) count may have a detrimental effect on computation time of a model like Ev, the time it takes for organisms to be selected or not because of multiple selection conditions in nature would not be similarly affected.
Now, Dr. Kleinman, if you were a real scientist and my argument were shown to be true, then you would thank me for advancing your knowledge in computer science and evolution. If you show me I’m wrong, I will thank you.
I await your refutation.
Last edited: