<?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"
	>
<channel>
	<title>Comments on: SICP section 2.2.1</title>
	<atom:link href="http://eli.thegreenplace.net/2007/08/10/sicp-section-221/feed/" rel="self" type="application/rss+xml" />
	<link>http://eli.thegreenplace.net/2007/08/10/sicp-section-221/</link>
	<description>Eli Bendersky's personal website</description>
	<pubDate>Fri, 21 Nov 2008 22:27:20 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: eliben</title>
		<link>http://eli.thegreenplace.net/2007/08/10/sicp-section-221/#comment-101442</link>
		<dc:creator>eliben</dc:creator>
		<pubDate>Sat, 26 Jan 2008 10:15:32 +0000</pubDate>
		<guid isPermaLink="false">http://eli.thegreenplace.net/2007/08/10/sicp-section-221/#comment-101442</guid>
		<description>Hi Sergey,
You're right, I did a mistake in my call tree, hence the proof is incorrect.
If you have an idea for a complete proof, let me know.</description>
		<content:encoded><![CDATA[<p>Hi Sergey,<br />
You&#8217;re right, I did a mistake in my call tree, hence the proof is incorrect.<br />
If you have an idea for a complete proof, let me know.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sergey Khenkin</title>
		<link>http://eli.thegreenplace.net/2007/08/10/sicp-section-221/#comment-101438</link>
		<dc:creator>Sergey Khenkin</dc:creator>
		<pubDate>Sat, 26 Jan 2008 09:36:31 +0000</pubDate>
		<guid isPermaLink="false">http://eli.thegreenplace.net/2007/08/10/sicp-section-221/#comment-101438</guid>
		<description>Hi Eli,
I like your website very much. The effort you did is really outstanding! Keep up great work.

I want to comment on exercise 2.19. The idea for a proof of the fact that the order of the list coin-values does not affect the answer of cc is very nice but the proof is not correct because actually the call tree should look like this:
&lt;code&gt;
(N, (a b c d))
&#124;-&gt;(N, (b c d))
&#124;--&#124;-&gt;(N, (c d))
&#124;--&#124;-&gt;(N-b, (b c d))
&#124;-&gt;(N-a, (a b c d))
&#124;--&#124;-&gt;(N-a, (b c d))
&#124;--&#124;-&gt;(N-a-a, (a b c d))
&lt;/code&gt;

So it is not symmetric for a and b unfortunately :(</description>
		<content:encoded><![CDATA[<p>Hi Eli,<br />
I like your website very much. The effort you did is really outstanding! Keep up great work.</p>
<p>I want to comment on exercise 2.19. The idea for a proof of the fact that the order of the list coin-values does not affect the answer of cc is very nice but the proof is not correct because actually the call tree should look like this:<br />
<code><br />
(N, (a b c d))<br />
|->(N, (b c d))<br />
|--|->(N, (c d))<br />
|--|->(N-b, (b c d))<br />
|->(N-a, (a b c d))<br />
|--|->(N-a, (b c d))<br />
|--|->(N-a-a, (a b c d))<br />
</code></p>
<p>So it is not symmetric for a and b unfortunately <img src='http://eli.thegreenplace.net/wp-includes/images/smilies/icon_sad.gif' alt=':(' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
</channel>
</rss>
