- Shopping Bag ( 0 items )
Posted August 17, 2005
Complete misunderstanding of Behe
I think Mr.Perakh is comletely misunderstanding Behe's definition of irreducible complexity. Behe's definition has nothing to do with the definition of irreducible complexity according to ATP. According to Behe, a biological system is irreducibly complex if it could not be formed by numerous, succesive, gradual modifications. Keeping this definition in mind, even a completely random bit stream is infact REDUCIBLE, because it can be produced by a computer program (Program A) that outputs random 0's and 1's gradually (one at a time randomly). So, according to Behe's definition there is no bit stream which is also irreducible. In order to better understand Behe's idea, we have to put a natural selection like mechanism into our bit stream analogy. For this purpose, suppose, we have another computer program (Program B) which operates on the output of Program A, and saves the bit streams only if their length are even and the number of 1's is twice as the number of 0's. So, only the bit streams satisfying the above criteria are considered to be functional, and others are just erased by Program B. Then, the bit stream 110110 becomes irreducibly complex, because every precursor bit stream to it will be eliminated by Program B and thus, it would have to be outputed by Program A as a whole. So, the question is : Is the bit stream 110110 irreducilbly complex under this conditions? The answer is YES. Does it show a pattern? YES. Unavoidable conclusion : Mr.Perakh's examples are WRONG!Was this review helpful? Yes NoThank you for your feedback. Report this reviewThank you, this review has been flagged.