Specified complexity

Specified complexity is a creationist argument introduced by William Dembski, used by advocates to promote the pseudoscience of intelligent design.

Dembski further argues that one can show by applying no-free-lunch theorems the inability of evolutionary algorithms to select or generate configurations of high specified complexity.

[4][5][6] A study by Wesley Elsberry and Jeffrey Shallit states: "Dembski's work is riddled with inconsistencies, equivocation, flawed use of mathematics, poor scholarship, and misrepresentation of others' results.

[10] Orgel used the phrase in discussing the differences between life and non-living structures: In brief, living organisms are distinguished by their specified complexity.

[11]The phrase was taken up by the creationists Charles Thaxton and Walter L Bradley in a chapter they contributed to the 1994 book The Creation Hypothesis where they discussed "design detection" and redefined "specified complexity" as a way of measuring information.

The value of the universal probability bound corresponds to the inverse of the upper limit of "the total number of [possible] specified events throughout cosmic history", as calculated by Dembski.

Dembski asserts that CSI exists in numerous features of living things, such as in DNA and in other functional biological molecules, and argues that it cannot be generated by the only known natural mechanisms of physical law and chance, or by their combination.

Moreover, he claims that CSI is holistic, with the whole being greater than the sum of the parts, and that this decisively eliminates Darwinian evolution as a possible means of its "creation".

"[18] In a more recent paper,[19] Dembski provides an account which he claims is simpler and adheres more closely to the theory of statistical hypothesis testing as formulated by Ronald Fisher.

Mathematically, E is a subset of Ω, the pattern T specifies a set of outcomes in Ω and E is a subset of T. Quoting Dembski[20] Thus, the event E might be a die toss that lands six and T might be the composite event consisting of all die tosses that land on an even face.Kolmogorov complexity provides a measure of the computational resources needed to specify a pattern (such as a DNA sequence or a sequence of alphabetic characters).

This condition can be restated as the inequality Dembski's expression σ is unrelated to any known concept in information theory, though he claims he can justify its relevance as follows: An intelligent agent S witnesses an event E and assigns it to some reference class of events Ω and within this reference class considers it as satisfying a specification T. Now consider the quantity φ(T) × P(T) (where P is the "chance" hypothesis): Think of S as trying to determine whether an archer, who has just shot an arrow at a large wall, happened to hit a tiny target on that wall by chance.

However, according to Elsberry and Shallit, "[specified complexity] has not been defined formally in any reputable peer-reviewed mathematical journal, nor (to the best of our knowledge) adopted by any researcher in information theory.

"[23] Thus far, Dembski's only attempt at calculating the specified complexity of a naturally occurring biological structure is in his book No Free Lunch, for the bacterial flagellum of E. coli.

He justifies this approach by appealing to Michael Behe's concept of "irreducible complexity" (IC), which leads him to assume that the flagellum could not come about by any gradual or step-wise process.

These authors add: "We have no objection to natural language specifications per se, provided there is some evident way to translate them to Dembski's formal framework.

[26] 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".

[27] 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 1065.

[8] Dembski's critics note that specified complexity, as originally defined by Leslie Orgel, is precisely what Darwinian evolution is supposed to create.

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.

"[16] Apart from such theoretical considerations, critics cite reports of evidence of the kind of evolutionary "spontanteous generation" that Dembski claims is too improbable to occur naturally.

Dembski's book No Free Lunch was criticised for not addressing the work of researchers who use computer simulations to investigate artificial life.

According to Shallit: The field of artificial life evidently poses a significant challenge to Dembski's claims about the failure of evolutionary algorithms to generate complexity.

Indeed, artificial life researchers regularly find their simulations of evolution producing the sorts of novelties and increased complexity that Dembski claims are impossible.

Possible targets with complexity ranking and probability not exceeding those of attained target T . Probability of set-theoretic union does not exceed φ( T ) × P( T )