Bernoulli's principle of insufficient reason and conservation of information in computer search

摘要: Conservation of information (COI) popularized by the no free lunch theorem is a great leveler search algorithms, showing that on average outperforms any other. Yet in practice some searches appear to outperform others. In consequence, have questioned significance COI performance algorithms. An underlying foundation Bernoulli's Principle Insufficient Reason1(PrOIR) which imposes uniform distribution space absence all prior knowledge about target or structure. The assumption conserved under mapping. If probability finding p, then problem subset p. More generally, some-to-many mappings result new where chance doing better than p 50–50. Consequently worse This can be viewed as confirming property COI. To properly assess for search, one must completely identify precise sources affect performance. discussion leads resolution seeming conflict between and observation algorithms perform well large class problems.