<?xml version="1.0" encoding="iso-8859-1"?><!-- generator="b2evolution/2.4.1" -->
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/">
	<channel>
		<title>Desunt Cetera - Latest comments</title>
		<link>http://www.desuntcetera.com/blogs/index.php?disp=comments</link>
		<description></description>
		<language>en-US</language>
		<docs>http://backend.userland.com/rss</docs>
		<admin:generatorAgent rdf:resource="http://b2evolution.net/?v=2.4.1"/>
		<ttl>60</ttl>
				<item>
			<title>In response to: On Evolution: Biological and Computational</title>
			<pubDate>Sat, 05 Apr 2008 22:32:45 +0000</pubDate>
			<dc:creator>Randall Landau [Member]</dc:creator>
			<guid isPermaLink="false">c61@http://www.desuntcetera.com/blogs/</guid>
			<description>You are correct. With an answer string where each answer is independent of the others, and access to the oracle as I described, you can find the answer via an exhaustive search that checks no more than 80 interactions.&lt;br /&gt;
&lt;br /&gt;
The test I originally played with, however, was a self referential test, where each question is about the answers to the test itself. On this test, this method does not work.&lt;br /&gt;
&lt;br /&gt;
Aside from this, the point of using this was it is a simple example that serves to demonstrate the fact that the genetic algorithm works, and does so much more efficiently than random chance. &lt;br /&gt;
&lt;br /&gt;
Realistically, this problem is too trivial to bother implementing a genetic algorithm on.</description>
			<content:encoded><![CDATA[You are correct. With an answer string where each answer is independent of the others, and access to the oracle as I described, you can find the answer via an exhaustive search that checks no more than 80 interactions.<br />
<br />
The test I originally played with, however, was a self referential test, where each question is about the answers to the test itself. On this test, this method does not work.<br />
<br />
Aside from this, the point of using this was it is a simple example that serves to demonstrate the fact that the genetic algorithm works, and does so much more efficiently than random chance. <br />
<br />
Realistically, this problem is too trivial to bother implementing a genetic algorithm on.]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=45&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c61</link>
		</item>
				<item>
			<title>In response to: On Evolution: Biological and Computational</title>
			<pubDate>Sat, 05 Apr 2008 17:13:24 +0000</pubDate>
			<dc:creator>Tony [Visitor]</dc:creator>
			<guid isPermaLink="false">c55@http://www.desuntcetera.com/blogs/</guid>
			<description>&lt;br /&gt;
Maybe I'm misunderstanding what's going on here, but it seems to me that due to the known lack of variable interactions, you could find the ideal string in 4 * 20 = 80 iterations.&lt;br /&gt;
&lt;br /&gt;
Start with AAAA...AA, and do each variable one-at-a-time until, at each step, the fitness increases.  Then, move onto the next variable.&lt;br /&gt;
&lt;br /&gt;</description>
			<content:encoded><![CDATA[<br />
Maybe I'm misunderstanding what's going on here, but it seems to me that due to the known lack of variable interactions, you could find the ideal string in 4 * 20 = 80 iterations.<br />
<br />
Start with AAAA...AA, and do each variable one-at-a-time until, at each step, the fitness increases.  Then, move onto the next variable.<br />
<br />]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=45&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c55</link>
		</item>
				<item>
			<title>In response to: Time Travel, Paradoxes and Computation</title>
			<pubDate>Tue, 20 Nov 2007 13:44:09 +0000</pubDate>
			<dc:creator>Randall Landau [Member]</dc:creator>
			<guid isPermaLink="false">c10@http://www.desuntcetera.com/blogs/</guid>
			<description>I had considered bringing that up, but that would've increased the length of the post considerably. &lt;br /&gt;
&lt;br /&gt;
Even ff we assume multiple universes, we still end up with ontological paradoxes, and also predestination paradoxes. </description>
			<content:encoded><![CDATA[I had considered bringing that up, but that would've increased the length of the post considerably. <br />
<br />
Even ff we assume multiple universes, we still end up with ontological paradoxes, and also predestination paradoxes. ]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=41&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c10</link>
		</item>
				<item>
			<title>In response to: Time Travel, Paradoxes and Computation</title>
			<pubDate>Tue, 20 Nov 2007 00:25:51 +0000</pubDate>
			<dc:creator>Glenn [Visitor]</dc:creator>
			<guid isPermaLink="false">c9@http://www.desuntcetera.com/blogs/</guid>
			<description>Of course, those paradoxes assume a single timeline the time-traveler navigates like a river, rather than a multiverse with many traversable timelines.&lt;br /&gt;
&lt;br /&gt;
I've no more in-depth knowledge on that issue than the average science fiction fan, though, so perhaps that theory has problems of its own that I'm not considering.</description>
			<content:encoded><![CDATA[Of course, those paradoxes assume a single timeline the time-traveler navigates like a river, rather than a multiverse with many traversable timelines.<br />
<br />
I've no more in-depth knowledge on that issue than the average science fiction fan, though, so perhaps that theory has problems of its own that I'm not considering.]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=41&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c9</link>
		</item>
				<item>
			<title>In response to: The Game of Go</title>
			<pubDate>Thu, 11 Oct 2007 19:44:03 +0000</pubDate>
			<dc:creator>Joe Lanegway [Visitor]</dc:creator>
			<guid isPermaLink="false">c8@http://www.desuntcetera.com/blogs/</guid>
			<description>There are in fact 55 unique opening moves, taking transposition into account. This was still an excellent exposition of the game.&lt;br /&gt;
</description>
			<content:encoded><![CDATA[There are in fact 55 unique opening moves, taking transposition into account. This was still an excellent exposition of the game.<br />
]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=37&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c8</link>
		</item>
				<item>
			<title>In response to: Blue Eyes: A Logic Problem and its Solution</title>
			<pubDate>Fri, 28 Sep 2007 22:03:47 +0000</pubDate>
			<dc:creator>Randall Landau [Member]</dc:creator>
			<guid isPermaLink="false">c7@http://www.desuntcetera.com/blogs/</guid>
			<description>The brown eyed people never get to leave. They are also going with the inductive proof laid out, but because they can see 100 blue eyed people, they are trying to determine if they are 101st blue eyed person. All the blue eyed people leave on the 100th night, so on the 101st day, the brown eyed people can infer that they have non-blue eyes, but that is all.</description>
			<content:encoded><![CDATA[The brown eyed people never get to leave. They are also going with the inductive proof laid out, but because they can see 100 blue eyed people, they are trying to determine if they are 101st blue eyed person. All the blue eyed people leave on the 100th night, so on the 101st day, the brown eyed people can infer that they have non-blue eyes, but that is all.]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=35&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c7</link>
		</item>
				<item>
			<title>In response to: Blue Eyes: A Logic Problem and its Solution</title>
			<pubDate>Fri, 28 Sep 2007 20:17:15 +0000</pubDate>
			<dc:creator>Skip Head [Visitor]</dc:creator>
			<guid isPermaLink="false">c6@http://www.desuntcetera.com/blogs/</guid>
			<description>What about the brown-eyed people.  How do they know they have brown eyes.  How do they know they shouldn't leave?</description>
			<content:encoded><![CDATA[What about the brown-eyed people.  How do they know they have brown eyes.  How do they know they shouldn't leave?]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=35&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c6</link>
		</item>
				<item>
			<title>In response to: Micro/Macro Evolution and the Paradox of the Heap</title>
			<pubDate>Fri, 14 Sep 2007 19:35:37 +0000</pubDate>
			<dc:creator>Randall Landau [Member]</dc:creator>
			<guid isPermaLink="false">c5@http://www.desuntcetera.com/blogs/</guid>
			<description>If we have some pile of sand with X grains in it, and wouldn't consider it to be a heap, the tiny change of 1 grain of sand doesn't turn it into a heap, unless you want to take the position that 99 grains of sand are not a heap, but 100 are. But then you are left to explain the essential difference between a pile of 99 grains of sand and 100 grains of sand that bestows on one heapdom and denies it to the other. &lt;br /&gt;
&lt;br /&gt;
From there we get to the conclusion that, if it is not already a heap of sand, no matter how many more grains of sand you add to it, it still isn't a heap.&lt;br /&gt;
&lt;br /&gt;
Its a paradox because, obviously, at some point it does become a heap. But we cannot pin that point down, because when we try to, we are forced to conclude that it never becomes a heap.&lt;br /&gt;
&lt;br /&gt;
Or, as I said, it can be turned around to conclude that &quot;once a heap, always a heap.&quot;</description>
			<content:encoded><![CDATA[If we have some pile of sand with X grains in it, and wouldn't consider it to be a heap, the tiny change of 1 grain of sand doesn't turn it into a heap, unless you want to take the position that 99 grains of sand are not a heap, but 100 are. But then you are left to explain the essential difference between a pile of 99 grains of sand and 100 grains of sand that bestows on one heapdom and denies it to the other. <br />
<br />
From there we get to the conclusion that, if it is not already a heap of sand, no matter how many more grains of sand you add to it, it still isn't a heap.<br />
<br />
Its a paradox because, obviously, at some point it does become a heap. But we cannot pin that point down, because when we try to, we are forced to conclude that it never becomes a heap.<br />
<br />
Or, as I said, it can be turned around to conclude that "once a heap, always a heap."]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=31&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c5</link>
		</item>
				<item>
			<title>In response to: Micro/Macro Evolution and the Paradox of the Heap</title>
			<pubDate>Fri, 14 Sep 2007 19:08:02 +0000</pubDate>
			<dc:creator>mind [Visitor]</dc:creator>
			<guid isPermaLink="false">c4@http://www.desuntcetera.com/blogs/</guid>
			<description>how is the first thing a paradox? it's simply an incorrect statement:&lt;br /&gt;
&lt;br /&gt;
&gt; X grains of sand are not a heap.&lt;br /&gt;
&gt; Adding 1 grain of sand to X grains of sand does not make a heap.&lt;br /&gt;
&lt;br /&gt;
obviously the second part is wrong, since it sometimes -does- make a heap. there's no paradox.&lt;br /&gt;
</description>
			<content:encoded><![CDATA[how is the first thing a paradox? it's simply an incorrect statement:<br />
<br />
> X grains of sand are not a heap.<br />
> Adding 1 grain of sand to X grains of sand does not make a heap.<br />
<br />
obviously the second part is wrong, since it sometimes -does- make a heap. there's no paradox.<br />
]]></content:encoded>
			<link>http://www.desuntcetera.com/blogs/index.php?p=31&amp;more=1&amp;c=1&amp;tb=1&amp;pb=1#c4</link>
		</item>
			</channel>
</rss>
