Universal plausibility/probability bound vs search challenge

As was recently discussed, contrary to objections being made, the concept of blind search and linked search challenge in a configuration or state space is a reasonable and even recognised concept. As we explore this concept a little more, an illustration may be helpful: With this in mind, we may again look at Dembski’s arrow and target illustration from NFL, p. 11: Now, let us ponder again Wiki on state space search: >>State space search is a process used in the field of computer science, including artificial intelligence (AI), in which successive configurations or states of an instance are considered, with the intention of finding a goal state with a desired property. Problems are often modelled as a state space, Read More ›

For some time now, objector DiEb has been raising the question, what do we mean by speaking of “search” in the context of evolutionary search. At 311 in the parody thread, she [IIRC] remarks: >>Search is a central term in the work of Dr. Dr. William Dembski jr, Dr. Winston Ewert, and Dr. Robert Marks II (DEM): it appears in the title of a couple of papers written by at least two of the authors, and it is mentioned hundreds of times in their textbook “Introduction to Evolutionary Informatics“. Strangely – and in difference from the other central term information, it is not defined in this textbook, and neither is search problem or search algorithm. Luckily, dozens of examples of Read More ›