Given problem set R; search space C; bias = distribution P(q|r) on candidates q in C given r in R; procedure for creating and testing q on any r within time t(q,r).
Searcher is n-bias-optimal if for any maximal search time T it will solve any r in R with solution p in C such that t(p,r) ? P(p|r) T/n
Most probable candidates get lionís share of total search time, precisely reflecting the bias
Back to J. Schmidhuber's OOPS page