Defining Irreducible Complexity

Irreducible Complexity is defined by Michael Behe as "A single system composed of several well-matched, interacting parts that contribute to the basic function, wherein the removal of any one of the parts causes the system to effectively cease functioning"

You need to login to download this video.
login or signup