RSS 2.0 Feed

» Welcome Guest Log In :: Register

Pages: (14) < [1] 2 3 4 5 6 ... >   
  Topic: Evolutionary Computation, Stuff that drives AEs nuts< Next Oldest | Next Newest >  

Posts: 301
Joined: May 2008

(Permalink) Posted: Feb. 11 2017,03:02   

Quote (WebHopper @ Feb. 10 2017,17: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
mutation rate
population size

Have you seen a site where this is done? On 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.

Try  "The probability of formation of a nucleotide sequence by random mutations" by Ulrich Utiger...

  405 replies since Mar. 17 2009,11:00 < Next Oldest | Next Newest >  

Pages: (14) < [1] 2 3 4 5 6 ... >   

Track this topic Email this topic Print this topic

[ Read the Board Rules ] | [Useful Links] | [Evolving Designs]