Okay will do but I thought this was a very open topic and we never really got off topic. If you want to create multiple topics though go ahead.
No I think we did a good job of keeping it on topic as well, I just like being able to focus on each topic. its hard (on both sides) to stay on topic enough. Perhaps I will hold off on that for now. As of right now, I want to go to irreducible complexity just for a moment.
I want to go first to the metaphor of a mousetrap. Often considered irreducibly complex, and often times not. Is this irreducibly complex. I am going to take the stance that it is and see if someone can prove otherwise.
Here are the parts
(1) a flat wooden platform to act as a base
(2) a metal hammer, which does the actual job of crushing the little mouse
(3) a spring with extended ends to press against the platform and the hammer when the trap is charged
(4) a sensitive catch that releases when slight pressure is applied
(5) a metal bar that connects to the catch and holds the hammer back when the trap is charged (there are also assorted staples to hold the system together)
You can use co-option, or any other method you prefer, however, you must show that it is NOT irreducibly complex.
This is more of a test than anything. And a little amusement for me. This is one of those things that I feel have been oversimplified.