NFL theorems prove evolutionary algorithms don't beat blind search (Talk.Origins)
From CreationWiki, the encyclopedia of creation science
(Redirected from NFL theorems prove evolutionary algorithms don't beat blind search)
Jump to navigationJump to search
Claim CF011.2:
- The No Free Lunch (NFL) theorems [Wolpert and Macready 1997] prove that evolutionary algorithms, when averaged across fitness functions, cannot outperform blind search. This means that an evolutionary algorithm can find a specified target only if complex specified information already resides in the fitness function. Evolutionary algorithms cannot account for the complex specified information we see in life; that information has to come from design.
Source: William Dembski, 2002b. No Free Lunch, Lanham, MD: Rowman & Littlefield, pp. xii, 199-212.
CreationWiki response:
|