More thoughts about Dembski and Marks’ project:
- The fact that the No Free Lunch theorem does not hold for a continuous search domain may have some consequences for the project pursued by Dembski and Marks. (That project, by the way, seems to have inspired at least two blogs devoted to criticizing it, DIEBLOG and Bounded Science. Some interesting points are raised there.) Their idea of studying search algorithms/heuristics for a target, then metaheuristics to select such heuristics, then meta-meta….-heuristics, and so on quickly generates uncountably infinite search domains for the meta-…-heuristics. Read the rest of this entry »