Archive for March 13, 2007

Is Irreducible Complexity Really Irreducible?

A friend send me a link to YouTube this week. (Thanks, Luke.) The presentation, attacking Michael Behe’s use of the flagellum as irreducible complexity, is very convincing. The presenter accurately presents Behe’s argument before the rebuttal. No, I don’t buy it. Here’s why: The presenter argues that there does exist a less complex organelle composed of only 10 proteins that are found in the bacterial flagellum, which requires approximately 48. He presents the idea as if an example of just 10 is superior to a more complex example. That is in no way the case, but it apparently is used in an attempt to sway the audience. The argument is that since one functional organelle exists of lesser complexity, and all other parts have use somewhere in biology; then the flagellum is no longer irreducible. Behe also addresses this in his Darwin’s Black Box. He agrees that one of the 48 steps to the flagellum’s complexity exists. Still, the flagellum argument can only be defeated if EVERY intermediary step can be demonstrated to be functional. An example would be the building of words from lesser words, such as the following:
a, at, bat, bate, abate, abated. Proving that a function exists for one lesser level of complexity and stating that all other parts have functions (he does say in the video that his argument is hypothetical) would be like saying all letters in the alphabet are useful, therefore the word “university” evolved from the word “sit.” (Sorry, I couldn’t think of a word that has 48 letters.) If irreducible complexity is not really irreducible, it is not demonstrated by this video.

|