<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Irreducible Complexity Still Not Disproven&#8230; Wait, What?</title>
	<atom:link href="http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/</link>
	<description>All the etcetera that&#039;s fit to read.</description>
	<lastBuildDate>Tue, 31 Jan 2012 13:31:01 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.1</generator>
	<item>
		<title>By: arensb</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-163979</link>
		<dc:creator>arensb</dc:creator>
		<pubDate>Thu, 22 Jan 2009 14:07:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-163979</guid>
		<description>&lt;p&gt;Freidenker:
Actually, it is possible to define irreducible complexity in such a way that certain systems are demonstrably IC. For instance, as Behe does, define an IC system as one where you can&#039;t &lt;em&gt;remove&lt;/em&gt; a part without it ceasing to function (saying nothing about adding parts). Or by saying that a system is IC if, if you remove a part, it no longer serves its original function (saying nothing about the parts serving different functions).&lt;/p&gt;

&lt;p&gt;The problem then, though, is that it doesn&#039;t disprove evolution. If you allow adding parts, then that opens the possibility of a scaffolding. And if you only consider the original function of the system, then you ignore the fact that subassemblies may serve other functions that may have been selected for.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Freidenker:<br />
Actually, it is possible to define irreducible complexity in such a way that certain systems are demonstrably IC. For instance, as Behe does, define an IC system as one where you can&#8217;t <em>remove</em> a part without it ceasing to function (saying nothing about adding parts). Or by saying that a system is IC if, if you remove a part, it no longer serves its original function (saying nothing about the parts serving different functions).</p>
<p>The problem then, though, is that it doesn&#8217;t disprove evolution. If you allow adding parts, then that opens the possibility of a scaffolding. And if you only consider the original function of the system, then you ignore the fact that subassemblies may serve other functions that may have been selected for.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Freidenker</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-163957</link>
		<dc:creator>Freidenker</dc:creator>
		<pubDate>Thu, 22 Jan 2009 08:42:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-163957</guid>
		<description>&lt;p&gt;Ahaha, someone make it stop! There is no way, not even in principle, that it is possible to prove that there ISN&#039;T irreducible complexity due to the same reason that you can&#039;t prove that there ISN&#039;T a God. That said, it makes both questions &lt;em&gt;not even wrong&lt;/em&gt;. &lt;/p&gt;

&lt;p&gt;I find it mind-boggling that creationists can claim the impossibility of disproving God somehow adds credibility to the God hypothesis, yet when they readily try to disprove the undisprovable with this IC nonsense - with the exact opposite result: &quot;I can&#039;t disprove evolution in this case, hence evolution never happened&quot; - this opposed to &quot;I can&#039;t disprove God, hence God exists&quot;.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Ahaha, someone make it stop! There is no way, not even in principle, that it is possible to prove that there ISN&#8217;T irreducible complexity due to the same reason that you can&#8217;t prove that there ISN&#8217;T a God. That said, it makes both questions <em>not even wrong</em>. </p>
<p>I find it mind-boggling that creationists can claim the impossibility of disproving God somehow adds credibility to the God hypothesis, yet when they readily try to disprove the undisprovable with this IC nonsense &#8211; with the exact opposite result: &#8220;I can&#8217;t disprove evolution in this case, hence evolution never happened&#8221; &#8211; this opposed to &#8220;I can&#8217;t disprove God, hence God exists&#8221;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: arensb</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-163611</link>
		<dc:creator>arensb</dc:creator>
		<pubDate>Wed, 14 Jan 2009 19:49:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-163611</guid>
		<description>&lt;p&gt;Bob:
Actually, if you go by what Behe wrote in &lt;cite&gt;Darwin&#039;s Black Box&lt;/cite&gt;, he makes the tacit assumption that evolution only adds, never removes. Otherwise, he might have recognized the scaffolding counterargument.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Bob:<br />
Actually, if you go by what Behe wrote in <cite>Darwin&#8217;s Black Box</cite>, he makes the tacit assumption that evolution only adds, never removes. Otherwise, he might have recognized the scaffolding counterargument.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bob</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-163608</link>
		<dc:creator>Bob</dc:creator>
		<pubDate>Wed, 14 Jan 2009 18:10:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-163608</guid>
		<description>&lt;p&gt;When irreducible complexity is used to discredit evolution the assumption is made that evolution adds and takes away pieces. An evolving bike wouldn&#039;t go from no wheel to wheel. A bike would more likely evolve from perhaps having a hexagonal wheel to a round wheel.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>When irreducible complexity is used to discredit evolution the assumption is made that evolution adds and takes away pieces. An evolving bike wouldn&#8217;t go from no wheel to wheel. A bike would more likely evolve from perhaps having a hexagonal wheel to a round wheel.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: arensb</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-162873</link>
		<dc:creator>arensb</dc:creator>
		<pubDate>Fri, 02 Jan 2009 01:37:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-162873</guid>
		<description>&lt;blockquote&gt;Never mind, my argument makes no less sense than anything the DI has put out there.&lt;/blockquote&gt;

&lt;p&gt;Just think how much money you could be making, writing articles and books in support of ID, and generally fleecing the credulous masses, if it weren&#039;t for those pesky ethics.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<blockquote><p>Never mind, my argument makes no less sense than anything the DI has put out there.</p></blockquote>
<p>Just think how much money you could be making, writing articles and books in support of ID, and generally fleecing the credulous masses, if it weren&#8217;t for those pesky ethics.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The Perky Skeptic</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-162858</link>
		<dc:creator>The Perky Skeptic</dc:creator>
		<pubDate>Thu, 01 Jan 2009 22:11:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-162858</guid>
		<description>&lt;p&gt;True, you can&#039;t remove a single stone from a Gothic arch without collapsing the structure, but before there were Gothic arches, there were Romanesque ones. Therefore you can ride a bicycle with the front wheel removed, bacterial flagella have precursors, evolution is a fact, and Behe is an idiot. Wait, what were we talking about again? Never mind, my argument makes no less sense than anything the DI has put out there. ;)&lt;/p&gt;

&lt;p&gt;Thanks, Arensb, for continuing to advance the cause of rationalism! Happy 2009!&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>True, you can&#8217;t remove a single stone from a Gothic arch without collapsing the structure, but before there were Gothic arches, there were Romanesque ones. Therefore you can ride a bicycle with the front wheel removed, bacterial flagella have precursors, evolution is a fact, and Behe is an idiot. Wait, what were we talking about again? Never mind, my argument makes no less sense than anything the DI has put out there. <img src='http://www.ooblick.com/weblog/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
<p>Thanks, Arensb, for continuing to advance the cause of rationalism! Happy 2009!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: arensb</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-162857</link>
		<dc:creator>arensb</dc:creator>
		<pubDate>Thu, 01 Jan 2009 21:33:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-162857</guid>
		<description>&lt;blockquote&gt;Unfortunately, I suspect that we’ll be stuck with irreducible complexity for the foreseeable future.&lt;/blockquote&gt;

&lt;p&gt;You&#039;re right, of course, but that doesn&#039;t mean we can&#039;t mock the IDiots.&lt;/p&gt;

&lt;blockquote&gt;I’ve never managed to get my head around why IC is so appealing.&lt;/blockquote&gt;

&lt;p&gt;Well, it &lt;em&gt;does&lt;/em&gt; make sense, at least theoretically: if it&#039;s possible to demonstrate that there&#039;s no way to get from A to B by some mechanism X, then it&#039;s logical to conclude that X does not explain the transition from A to B.&lt;/p&gt;

&lt;p&gt;As you point out further down, actually demonstrating it is trickier than it sounds, but the general outline is sound.&lt;/p&gt;

&lt;blockquote&gt;that doesn’t mean that such a system can’t be constructed from a system of N + 1 parts which in tern came from a non-IC system.&lt;/blockquote&gt;

&lt;p&gt;I think you&#039;re talking about Gothic arches, right? An arch is an IC system: each stone helps prop up the entire structure, and if you remove any stone, the whole thing collapses. And, per Behe&#039;s argument, it&#039;s impossible to build an arch by adding one stone at a time.&lt;/p&gt;

&lt;p&gt;So the way to build an arch is to build a scaffolding that&#039;ll keep the incomplete arch from collapsing. Once the last stone is in place, you remove the scaffolding.&lt;/p&gt;

&lt;blockquote&gt;Also, I’m not much of a CS/math guy, but IIRC, formally proving programs and the like to be “minimal” is a pretty damned difficult thing to do anyway. I would think that proving something “irreducible” would be a similar burden.&lt;/blockquote&gt;

&lt;p&gt;Pretty much, yeah, as I recall. I remember seeing a few such proofs in math class, and thinking that they were rather beautiful. I&#039;ve heard of similar things in engineering, where there&#039;s a formula describing the most efficient steam engine possible, or something like that. The person who told me about this said the math wasn&#039;t 100% certain the way that mathematical proofs are, but is based on some very reasonable assumptions.&lt;/p&gt;

&lt;p&gt;The flaw (or one flaw) with Behe&#039;s argument is that he simplifies the problem in order to make it solvable: he says that if you remove any part of the bacterial flagellum, it no longer functions &lt;em&gt;as a flagellum&lt;/em&gt;. But what he needs to demonstrate is that if you remove any part of a flagellum, it no longer functions as &lt;em&gt;anything&lt;/em&gt; (or rather, isn&#039;t something that could have been selected for).&lt;/p&gt;

&lt;p&gt;And that is much, much harder to show. Kind of like demonstrating the absence of a leak in a tire, without actually immersing it in water.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<blockquote><p>Unfortunately, I suspect that we’ll be stuck with irreducible complexity for the foreseeable future.</p></blockquote>
<p>You&#8217;re right, of course, but that doesn&#8217;t mean we can&#8217;t mock the IDiots.</p>
<blockquote><p>I’ve never managed to get my head around why IC is so appealing.</p></blockquote>
<p>Well, it <em>does</em> make sense, at least theoretically: if it&#8217;s possible to demonstrate that there&#8217;s no way to get from A to B by some mechanism X, then it&#8217;s logical to conclude that X does not explain the transition from A to B.</p>
<p>As you point out further down, actually demonstrating it is trickier than it sounds, but the general outline is sound.</p>
<blockquote><p>that doesn’t mean that such a system can’t be constructed from a system of N + 1 parts which in tern came from a non-IC system.</p></blockquote>
<p>I think you&#8217;re talking about Gothic arches, right? An arch is an IC system: each stone helps prop up the entire structure, and if you remove any stone, the whole thing collapses. And, per Behe&#8217;s argument, it&#8217;s impossible to build an arch by adding one stone at a time.</p>
<p>So the way to build an arch is to build a scaffolding that&#8217;ll keep the incomplete arch from collapsing. Once the last stone is in place, you remove the scaffolding.</p>
<blockquote><p>Also, I’m not much of a CS/math guy, but IIRC, formally proving programs and the like to be “minimal” is a pretty damned difficult thing to do anyway. I would think that proving something “irreducible” would be a similar burden.</p></blockquote>
<p>Pretty much, yeah, as I recall. I remember seeing a few such proofs in math class, and thinking that they were rather beautiful. I&#8217;ve heard of similar things in engineering, where there&#8217;s a formula describing the most efficient steam engine possible, or something like that. The person who told me about this said the math wasn&#8217;t 100% certain the way that mathematical proofs are, but is based on some very reasonable assumptions.</p>
<p>The flaw (or one flaw) with Behe&#8217;s argument is that he simplifies the problem in order to make it solvable: he says that if you remove any part of the bacterial flagellum, it no longer functions <em>as a flagellum</em>. But what he needs to demonstrate is that if you remove any part of a flagellum, it no longer functions as <em>anything</em> (or rather, isn&#8217;t something that could have been selected for).</p>
<p>And that is much, much harder to show. Kind of like demonstrating the absence of a leak in a tire, without actually immersing it in water.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Troublesome Frog</title>
		<link>http://www.ooblick.com/weblog/2008/12/31/irreducible-complexity-still-not-disproven-wait-what/comment-page-1/#comment-162795</link>
		<dc:creator>Troublesome Frog</dc:creator>
		<pubDate>Thu, 01 Jan 2009 01:38:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.ooblick.com/weblog/?p=684#comment-162795</guid>
		<description>&lt;p&gt;Unfortunately, I suspect that we&#039;ll be stuck with irreducible complexity for the foreseeable future.  It&#039;s just too easy to move the goalposts.  The only way to stomp it out is to exhaustively refute every member of the infinitely large set of possibilities.  Even if they did manage it somehow, the argument would shift from, &quot;You can&#039;t explain how this could have happened,&quot; to, &quot;Well, it could have happened that way, but that&#039;s a just-so story!&quot;  The observant reader will note that Behe happily does this fairly regularly.  &lt;/p&gt;

&lt;p&gt;I&#039;ve never managed to get my head around why IC is so appealing.  Even if we assume that there are systems with N parts that cannot function with N - 1 parts, that doesn&#039;t mean that such a system can&#039;t be constructed from a system of N + 1 parts which in tern came from a non-IC system.  It&#039;s like seeing a climber who has climbed himself down a cliff face and gotten stuck and assuming that he can fly because there&#039;s no path up to where he is.&lt;/p&gt;

&lt;p&gt;Also, I&#039;m not much of a CS/math guy, but IIRC, formally proving programs and the like to be &quot;minimal&quot; is a pretty damned difficult thing to do anyway.  I would think that proving something &quot;irreducible&quot; would be a similar burden.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Unfortunately, I suspect that we&#8217;ll be stuck with irreducible complexity for the foreseeable future.  It&#8217;s just too easy to move the goalposts.  The only way to stomp it out is to exhaustively refute every member of the infinitely large set of possibilities.  Even if they did manage it somehow, the argument would shift from, &#8220;You can&#8217;t explain how this could have happened,&#8221; to, &#8220;Well, it could have happened that way, but that&#8217;s a just-so story!&#8221;  The observant reader will note that Behe happily does this fairly regularly.  </p>
<p>I&#8217;ve never managed to get my head around why IC is so appealing.  Even if we assume that there are systems with N parts that cannot function with N &#8211; 1 parts, that doesn&#8217;t mean that such a system can&#8217;t be constructed from a system of N + 1 parts which in tern came from a non-IC system.  It&#8217;s like seeing a climber who has climbed himself down a cliff face and gotten stuck and assuming that he can fly because there&#8217;s no path up to where he is.</p>
<p>Also, I&#8217;m not much of a CS/math guy, but IIRC, formally proving programs and the like to be &#8220;minimal&#8221; is a pretty damned difficult thing to do anyway.  I would think that proving something &#8220;irreducible&#8221; would be a similar burden.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

