|Wesley R. Elsberry
Joined: May 2002
|Quote (WebHopper @ Feb. 10 2017,11:32)|
I am wondering if there is an analytical solution to the Weasel algorithm. I think of a probability distribution of the number of trials necessary to achieve a target sequence, the mean and variance implying the following parameters:
length of the alphabet
length of the target sequence
Have you seen a site where this is done? On evoinfo.org Dembski proposes a solution for what he calls "partitioned search". But I am looking for a solution of what he names "proximity reward search", which apparently is the Weasel algorithm. To be clear, I am not interested in a numerical but analytical solution of the mean and variance as a functions of the above-mentioned parameters.
Further up the thread, I pointed out the difference between partitioned search and "weasel".
"Locking" or "latching" is the same as removing the term that allows for correct bases to mutate to incorrect ones. What remains is an expectation that the number of correct bases can only monotonically increase.
If you have the analytical form you like for partitioned search, then modify to add in the additional element I note for "weasel" and any other adjustments. I left off that project before fully working up the population component for probabilities.
I've had some issues with hosted images going stale. I need to look up some of my graphs in this thread and restore them.
And somewhere, sometime, I know I did a numerical scan of parameter space to show the likely range of parameters for Dawkins' original runs given his reported generation times for results. I'm not finding where I shared that, though.
"You can't teach an old dogma new tricks." - Dorothy Parker