<?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 for dmtdev</title>
	<atom:link href="http://www.dmtdev.com/blog/comments/feed" rel="self" type="application/rss+xml" />
	<link>http://www.dmtdev.com/blog</link>
	<description>Unusual information, opinions, and musings on obscure intellectual topics.</description>
	<pubDate>Thu, 11 Mar 2010 23:42:50 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.7</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Fully iterative Ackermann function computation by dmyersturnbull</title>
		<link>http://www.dmtdev.com/blog/computer-science/fully-iterative-ackermann-function-computation/comment-page-1#comment-8289</link>
		<dc:creator>dmyersturnbull</dc:creator>
		<pubDate>Fri, 22 Jan 2010 00:16:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.dmtdev.com/blog/?p=643#comment-8289</guid>
		<description>@Anonymous
Correct. Saving function overhead is the sole objective. Since compilers often fail to recognize tail recursion, iterative implementations are often preferred. Recursion and iteration accomplish the same thing, and in general, are really the same. Thanks for your comment. I’ll update my post to reflect this.</description>
		<content:encoded><![CDATA[<p>@Anonymous<br />
Correct. Saving function overhead is the sole objective. Since compilers often fail to recognize tail recursion, iterative implementations are often preferred. Recursion and iteration accomplish the same thing, and in general, are really the same. Thanks for your comment. I’ll update my post to reflect this.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fully iterative Ackermann function computation by Anonymous</title>
		<link>http://www.dmtdev.com/blog/computer-science/fully-iterative-ackermann-function-computation/comment-page-1#comment-8280</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Wed, 20 Jan 2010 15:28:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.dmtdev.com/blog/?p=643#comment-8280</guid>
		<description>That's just simulating recursion using a stack.  Think about how a computer implements function calls using stack frames.  All you save is function call overhead, you still need the same amount of storage from a big-O point of view as any other recursive implementation.</description>
		<content:encoded><![CDATA[<p>That&#8217;s just simulating recursion using a stack.  Think about how a computer implements function calls using stack frames.  All you save is function call overhead, you still need the same amount of storage from a big-O point of view as any other recursive implementation.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Launch4J: Jar Wrapper by gardenomlet</title>
		<link>http://www.dmtdev.com/blog/computer-science/development-tools/launch4j-jar-wrapper/comment-page-1#comment-2210</link>
		<dc:creator>gardenomlet</dc:creator>
		<pubDate>Sun, 15 Mar 2009 17:36:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.dmtdev.com/blog/uncategorized/launch4j-jar-wrapper#comment-2210</guid>
		<description>when i try to choose the main class file using the browse button in classpath tal of lauch 4j, i get an error message which is "unable to open Zip file" what do i have to do for this</description>
		<content:encoded><![CDATA[<p>when i try to choose the main class file using the browse button in classpath tal of lauch 4j, i get an error message which is &#8220;unable to open Zip file&#8221; what do i have to do for this</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.267 seconds -->
