<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Genetic Programming: Code smarter than you!</title>
	<atom:link href="http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/feed/" rel="self" type="application/rss+xml" />
	<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/</link>
	<description></description>
	<lastBuildDate>Sat, 28 Jan 2012 14:35:30 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: yanuar</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1669</link>
		<dc:creator><![CDATA[yanuar]]></dc:creator>
		<pubDate>Wed, 28 Jul 2010 12:25:23 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1669</guid>
		<description><![CDATA[hi,
i&#039;m newbie in c#,  are you using any control parameters within this program (crossover, mutation probability, max generation, etc)]]></description>
		<content:encoded><![CDATA[<p>hi,<br />
i&#8217;m newbie in c#,  are you using any control parameters within this program (crossover, mutation probability, max generation, etc)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Genetic Programming: Evolving Domain Logic a&#8217;la CQRS &#171; Roger Alsing Weblog</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1582</link>
		<dc:creator><![CDATA[Genetic Programming: Evolving Domain Logic a&#8217;la CQRS &#171; Roger Alsing Weblog]]></dc:creator>
		<pubDate>Thu, 01 Apr 2010 15:15:41 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1582</guid>
		<description><![CDATA[[...] formula that evolves to come up with a formula a given set of in and out parameters. (see http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/) While that is interesting, it would be much more interesting and profitable if one could evolve an [...]]]></description>
		<content:encoded><![CDATA[<p>[...] formula that evolves to come up with a formula a given set of in and out parameters. (see <a href="http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/" rel="nofollow">http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/</a>) While that is interesting, it would be much more interesting and profitable if one could evolve an [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dan Byström</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1542</link>
		<dc:creator><![CDATA[Dan Byström]]></dc:creator>
		<pubDate>Mon, 15 Mar 2010 08:39:29 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1542</guid>
		<description><![CDATA[Did you really write that code in less than 30 sec??? - that&#039;s truly amazing! ;-P]]></description>
		<content:encoded><![CDATA[<p>Did you really write that code in less than 30 sec??? &#8211; that&#8217;s truly amazing! ;-P</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Corey Sunwold</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1534</link>
		<dc:creator><![CDATA[Corey Sunwold]]></dc:creator>
		<pubDate>Tue, 02 Mar 2010 17:13:33 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1534</guid>
		<description><![CDATA[Roger,

Just curious but have you considered using the Expression Trees introduced in C# 3.0 for building the operators and Math Function?]]></description>
		<content:encoded><![CDATA[<p>Roger,</p>
<p>Just curious but have you considered using the Expression Trees introduced in C# 3.0 for building the operators and Math Function?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Atanas</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1527</link>
		<dc:creator><![CDATA[Atanas]]></dc:creator>
		<pubDate>Thu, 25 Feb 2010 21:35:40 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1527</guid>
		<description><![CDATA[Hi Rusty,

Actually I did&#039;t write program too.

My math solving was different:

First I realize that result is divided exactly on x+y ... and result is x ... so formula is x(x+y) ... because of simpler calculation this took me minute or two to solve it.

But when I try gbrainy I found that I am not so smart :D
(wow ... sentence wit 3 time I ... tc tc tc)]]></description>
		<content:encoded><![CDATA[<p>Hi Rusty,</p>
<p>Actually I did&#8217;t write program too.</p>
<p>My math solving was different:</p>
<p>First I realize that result is divided exactly on x+y &#8230; and result is x &#8230; so formula is x(x+y) &#8230; because of simpler calculation this took me minute or two to solve it.</p>
<p>But when I try gbrainy I found that I am not so smart :D<br />
(wow &#8230; sentence wit 3 time I &#8230; tc tc tc)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anders Hesselbom</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1526</link>
		<dc:creator><![CDATA[Anders Hesselbom]]></dc:creator>
		<pubDate>Tue, 23 Feb 2010 20:58:55 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1526</guid>
		<description><![CDATA[Nice to see this one again! I remember very well when I tested this. Truly impressive.]]></description>
		<content:encoded><![CDATA[<p>Nice to see this one again! I remember very well when I tested this. Truly impressive.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rusty</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1515</link>
		<dc:creator><![CDATA[Rusty]]></dc:creator>
		<pubDate>Thu, 18 Feb 2010 00:08:33 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1515</guid>
		<description><![CDATA[I used a slightly different formula to come up with the same answer. I didn&#039;t write a program, but just used some trial and error to come up with ways to manipulate the numbers alone and together to see if they would have the same result. It probably took me about 10 minutes. Definitely slower than the solver you used. My formula was:
x^2 + x*y = answer
so 2^2 + (2)*(3) = 4 + 6 = 10
and 7^2 + (7)*(2) = 49 + 14 = 63
etcetera
therefore 9^2 + (9)*(7) = 81 + 63 = 144]]></description>
		<content:encoded><![CDATA[<p>I used a slightly different formula to come up with the same answer. I didn&#8217;t write a program, but just used some trial and error to come up with ways to manipulate the numbers alone and together to see if they would have the same result. It probably took me about 10 minutes. Definitely slower than the solver you used. My formula was:<br />
x^2 + x*y = answer<br />
so 2^2 + (2)*(3) = 4 + 6 = 10<br />
and 7^2 + (7)*(2) = 49 + 14 = 63<br />
etcetera<br />
therefore 9^2 + (9)*(7) = 81 + 63 = 144</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Atanas</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1506</link>
		<dc:creator><![CDATA[Atanas]]></dc:creator>
		<pubDate>Sun, 14 Feb 2010 17:52:09 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1506</guid>
		<description><![CDATA[x(x+y) ... 9*(9+7) = 144]]></description>
		<content:encoded><![CDATA[<p>x(x+y) &#8230; 9*(9+7) = 144</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Paul Mohr</title>
		<link>http://rogeralsing.com/2010/02/14/genetic-programming-code-smarter-than-you/#comment-1505</link>
		<dc:creator><![CDATA[Paul Mohr]]></dc:creator>
		<pubDate>Sun, 14 Feb 2010 10:07:45 +0000</pubDate>
		<guid isPermaLink="false">http://rogeralsing.com/?p=739#comment-1505</guid>
		<description><![CDATA[That was very interesting. Nature and computers never get bored or frustrated and can do factorial expansions without wondering whether they should doing something else that is more fun.
When I looked at the link to genetic-programming-math, I discovered this link to the image is 404 for genmath41.gif. 
Gbrainy, which is a Google program of logic games, has some interesting problems.
It is frustrating to play games against the computer, especially if they are solved games and thus the computer knows at each step of the tree, how to rate its opponent.]]></description>
		<content:encoded><![CDATA[<p>That was very interesting. Nature and computers never get bored or frustrated and can do factorial expansions without wondering whether they should doing something else that is more fun.<br />
When I looked at the link to genetic-programming-math, I discovered this link to the image is 404 for genmath41.gif.<br />
Gbrainy, which is a Google program of logic games, has some interesting problems.<br />
It is frustrating to play games against the computer, especially if they are solved games and thus the computer knows at each step of the tree, how to rate its opponent.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

