<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/'><id>tag:blogger.com,1999:blog-4757118446768919900.post7867200278181531153..comments</id><updated>2011-07-18T01:56:15.512-07:00</updated><category term='darwin'/><category term='loop'/><category term='optimisation'/><category term='tools'/><category term='robot'/><category term='privacy'/><category term='benchmark'/><category term='events'/><category term='altera'/><category term='koch curve'/><category term='forth'/><category term='8080'/><category term='museum'/><category term='demo'/><category term='assembly'/><category term='cellular automata'/><category term='easter'/><category term='compression'/><category term='bf'/><category term='128b'/><category term='ssem'/><category term='core war'/><category term='bookshelf'/><category term='programming books'/><category term='corewar'/><category term='semaphore'/><category term='cave'/><category term='z80'/><category term='operating system'/><category term='sin'/><category term='contest'/><category term='arduino'/><category term='text adventure'/><category term='home computers'/><category term='basic'/><category term='programming'/><category term='8086'/><category term='subneg'/><category term='optimise'/><category term='rssb'/><category term='font'/><category term='bf joust'/><category term='game'/><category term='#songsincode'/><category term='asm'/><category term='microcontroller'/><category term='editor'/><category term='primes'/><category term='infinite loop'/><category term='emulator'/><category term='redcode'/><category term='subleq'/><category term='twitter'/><category term='kernel'/><category term='corelife'/><category term='history'/><category term='alife'/><category term='quotes'/><category term='urisc'/><category term='til'/><category term='oisc'/><category term='8088'/><category term='sbn'/><category term='recursion'/><title type='text'>Comments on Retro Programming: Recursion via Pascal</title><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://www.retroprogramming.com/feeds/7867200278181531153/comments/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default'/><link rel='alternate' type='text/html' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html'/><author><name>John Metcalf</name><uri>http://www.blogger.com/profile/09108374348083307900</uri><email>noreply@blogger.com</email><gd:image xmlns:gd='http://schemas.google.com/g/2005' rel='http://schemas.google.com/g/2005#thumbnail' width='32' height='32' src='http://2.bp.blogspot.com/_kDyMtZ_dJwQ/SPJWvCQ5QpI/AAAAAAAAAWY/cnwIw9hloA0/S220/me.jpg'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>5</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-4757118446768919900.post-411072991227839811</id><published>2011-07-18T01:56:15.512-07:00</published><updated>2011-07-18T01:56:15.512-07:00</updated><title type='text'>Pascal is definitely one of my favorite languages....</title><content type='html'>Pascal is definitely one of my favorite languages. Sadly, its often overlooked...&lt;br /&gt;&lt;br /&gt;My thoughts exactly! It has soooo many pros over the C-based languages -and yet because of Unix, people completely shoved it to a dark corner. My aim is to try to promote the language.</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/411072991227839811'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/411072991227839811'/><link rel='alternate' type='text/html' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html?showComment=1310979375512#c411072991227839811' title=''/><author><name>وقاص</name><uri>http://www.blogger.com/profile/18162503326917392238</uri><email>noreply@blogger.com</email><gd:image xmlns:gd='http://schemas.google.com/g/2005' rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html' ref='tag:blogger.com,1999:blog-4757118446768919900.post-7867200278181531153' source='http://www.blogger.com/feeds/4757118446768919900/posts/default/7867200278181531153' type='text/html'/><gd:extendedProperty xmlns:gd='http://schemas.google.com/g/2005' name='blogger.itemClass' value='pid-1601175130'/></entry><entry><id>tag:blogger.com,1999:blog-4757118446768919900.post-5428657501008334678</id><published>2011-02-16T14:54:59.932-08:00</published><updated>2011-02-16T14:54:59.932-08:00</updated><title type='text'>Here is a factorial function that illustrates a &amp;q...</title><content type='html'>Here is a factorial function that illustrates a &amp;quot;pure&amp;quot; recursive form:&lt;br /&gt;&lt;br /&gt;long factorial(long n)&lt;br /&gt;  { return(n&amp;gt;0?(n*factorial(n-1)):1); }&lt;br /&gt;&lt;br /&gt;Pascal is definitely one of my favorite languages.  Sadly, its often overlooked...</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/5428657501008334678'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/5428657501008334678'/><link rel='alternate' type='text/html' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html?showComment=1297896899932#c5428657501008334678' title=''/><author><name>Mar Matthias Darin</name><uri>http://matthias.tanaya.net/</uri><email>noreply@blogger.com</email><gd:image xmlns:gd='http://schemas.google.com/g/2005' rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img1.blogblog.com/img/blank.gif'/></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html' ref='tag:blogger.com,1999:blog-4757118446768919900.post-7867200278181531153' source='http://www.blogger.com/feeds/4757118446768919900/posts/default/7867200278181531153' type='text/html'/><gd:extendedProperty xmlns:gd='http://schemas.google.com/g/2005' name='blogger.itemClass' value='pid-1914303542'/></entry><entry><id>tag:blogger.com,1999:blog-4757118446768919900.post-7836078580413453661</id><published>2011-01-13T02:30:54.408-08:00</published><updated>2011-01-13T02:30:54.408-08:00</updated><title type='text'>The x^n code is in O(n) because p(x, n div 2) is c...</title><content type='html'>The x^n code is in O(n) because p(x, n div 2) is called twice instead of being memoized. Right? :D</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/7836078580413453661'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/7836078580413453661'/><link rel='alternate' type='text/html' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html?showComment=1294914654408#c7836078580413453661' title=''/><author><name>fushar</name><uri>http://fusharblog.com</uri><email>noreply@blogger.com</email><gd:image xmlns:gd='http://schemas.google.com/g/2005' rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img1.blogblog.com/img/blank.gif'/></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html' ref='tag:blogger.com,1999:blog-4757118446768919900.post-7867200278181531153' source='http://www.blogger.com/feeds/4757118446768919900/posts/default/7867200278181531153' type='text/html'/><gd:extendedProperty xmlns:gd='http://schemas.google.com/g/2005' name='blogger.itemClass' value='pid-1879941769'/></entry><entry><id>tag:blogger.com,1999:blog-4757118446768919900.post-8839978266351302580</id><published>2011-01-12T16:39:15.902-08:00</published><updated>2011-01-12T16:39:15.902-08:00</updated><title type='text'>Anonymous: thanks, fixed it :-)</title><content type='html'>Anonymous: thanks, fixed it :-)</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/8839978266351302580'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/8839978266351302580'/><link rel='alternate' type='text/html' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html?showComment=1294879155902#c8839978266351302580' title=''/><author><name>John</name><uri>http://retroprogramming.com</uri><email>noreply@blogger.com</email><gd:image xmlns:gd='http://schemas.google.com/g/2005' rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img1.blogblog.com/img/blank.gif'/></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html' ref='tag:blogger.com,1999:blog-4757118446768919900.post-7867200278181531153' source='http://www.blogger.com/feeds/4757118446768919900/posts/default/7867200278181531153' type='text/html'/><gd:extendedProperty xmlns:gd='http://schemas.google.com/g/2005' name='blogger.itemClass' value='pid-783504081'/></entry><entry><id>tag:blogger.com,1999:blog-4757118446768919900.post-4326049227362378788</id><published>2011-01-12T16:28:02.561-08:00</published><updated>2011-01-12T16:28:02.561-08:00</updated><title type='text'>C uses == for equality</title><content type='html'>C uses == for equality</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/4326049227362378788'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/4757118446768919900/7867200278181531153/comments/default/4326049227362378788'/><link rel='alternate' type='text/html' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html?showComment=1294878482561#c4326049227362378788' title=''/><author><name>Anonymous</name><email>noreply@blogger.com</email><gd:image xmlns:gd='http://schemas.google.com/g/2005' rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img1.blogblog.com/img/blank.gif'/></author><thr:in-reply-to xmlns:thr='http://purl.org/syndication/thread/1.0' href='http://www.retroprogramming.com/2011/01/recursion-via-pascal.html' ref='tag:blogger.com,1999:blog-4757118446768919900.post-7867200278181531153' source='http://www.blogger.com/feeds/4757118446768919900/posts/default/7867200278181531153' type='text/html'/><gd:extendedProperty xmlns:gd='http://schemas.google.com/g/2005' name='blogger.itemClass' value='pid-1389461521'/></entry></feed>
