Content deleted Content added
Unnecessarily biased negative commentary was removed to make the article more fair and balanced. Tags: Reverted references removed |
Hob Gadling (talk | contribs) Undid revision 1187600048 by 67.171.39.254 (talk) read WP:FRINGE |
||
Line 2:
{{Intelligent Design}}
'''Specified complexity''' is a
Dembski argues that it is impossible for specified complexity to exist in patterns displayed by configurations formed by unguided processes. Therefore, Dembski argues, the fact that specified complex patterns can be found in living things indicates some kind of guidance in their formation, which is indicative of intelligence. Dembski further argues that one can show by applying [[No free lunch in search and optimization|no-free-lunch theorems]] the inability of evolutionary algorithms to select or generate configurations of high specified complexity. Dembski states that specified complexity is a reliable marker of design by an [[intelligent designer|intelligent agent]]—a central tenet to intelligent design, which Dembski argues for in opposition to [[evolution|modern evolutionary theory]]. Specified complexity is what Dembski terms an "explanatory filter": one can recognize design by detecting '''complex specified information''' ('''CSI'''). Dembski argues that the unguided emergence of CSI solely according to known [[physical laws]] and chance is highly improbable.<ref>Olofsson, P., "Intelligent design and mathematical statistics: a troubled alliance", ''Biology and Philosophy'', (2008) 23: 545. {{doi|10.1007/s10539-007-9078-6}} ([https://web.archive.org/web/20180120070714/https://pdfs.semanticscholar.org/8def/d6c4582d252e55d8b4a188ccdb9bff6453c3.pdf pdf], retrieved December 18, 2017)</ref>
Line 100:
{{Synthesis|section|date=May 2012}}
The soundness of Dembski's concept of specified complexity and the validity of arguments based on this concept are widely disputed. A frequent criticism (see Elsberry and Shallit) is that Dembski has used the terms "complexity", "information" and "improbability" interchangeably. These numbers measure properties of things of different types: Complexity measures how hard it is to describe an object (such as a bitstring), information is how much the uncertainty about the state of an object is reduced by knowing the state of another object or system,<ref>{{cite journal
| last1 = Adami
| first1 = Christoph
Line 126:
| author = Erik Tellgren}}</ref> Dembski responded in part that he is not "in the business of offering a strict [[mathematical proof]] for the inability of material mechanisms to generate specified complexity".<ref>William A. Dembski, (Aug 2002). [http://www.designinference.com/documents/2002.08.Erik_Response.htm ''If Only Darwinists Scrutinized Their Own Work as Closely: A Response to "Erik"''] {{Webarchive|url=https://web.archive.org/web/20130226010345/http://designinference.com/documents/2002.08.Erik_Response.htm |date=2013-02-26 }}.</ref> [[Jeffrey Shallit]] states that Demski's mathematical argument has multiple problems, for example; a crucial calculation on page 297 of ''No Free Lunch'' is off by a factor of approximately 10<sup>65</sup>.<ref name=shallit>[[Jeffrey Shallit]] (2002) [http://www.cs.uwaterloo.ca/~shallit/nflr3.txt A review of Dembski's ''No Free Lunch'']</ref>
Dembski's calculations show how a simple [[smooth function]] cannot gain information. He therefore concludes that there must be a designer to obtain CSI. However, natural selection has a branching mapping from one to many (replication) followed by pruning mapping of the many back down to a few (selection). When information is replicated, some copies can be differently modified while others remain the same, allowing information to increase. These increasing and reductional mappings were not modeled by Dembski. In other words, Dembski's calculations do not model birth and death. This basic flaw in his modeling renders all of Dembski's subsequent calculations and reasoning in ''No Free Lunch'' irrelevant because his basic model does not reflect reality. Since the basis of ''No Free Lunch'' relies on this flawed argument, the entire thesis of the book collapses.<ref>Thomas D. Schneider. (2002) [http://www.lecb.ncifcrf.gov/~toms/paper/ev/dembski/specified.complexity.html Dissecting Dembski's "Complex Specified Information"] {{webarchive|url=https://web.archive.org/web/20051026135240/http://www.lecb.ncifcrf.gov/~toms/paper/ev/dembski/specified.complexity.html |date=2005-10-26 }}</ref>
Dembski's calculations show how a simple [[smooth function]] cannot gain information. He therefore concludes that there must be a designer to obtain CSI. However, according to Martin Nowak, a Harvard professor of mathematics and evolutionary biology "We cannot calculate the probability that an eye came about. We don't have the information to make the calculation".<ref name="time.com"/>▼
▲
Dembski's critics note that specified complexity, as originally defined by Leslie Orgel, is precisely what Darwinian evolution is supposed to create. Critics maintain that Dembski uses "complex" as most people would use "absurdly improbable". They also claim that his argument is [[circular reasoning|circular]]: CSI cannot occur naturally because Dembski has defined it thus. They argue that to successfully demonstrate the existence of CSI, it would be necessary to show that some biological feature undoubtedly has an extremely low probability of occurring by any natural means whatsoever, something which Dembski and others have almost never attempted to do. Such calculations depend on the accurate assessment of numerous contributing probabilities, the determination of which is often necessarily subjective. Hence, CSI can at most provide a "very high probability", but not absolute certainty.
|