<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Impromptus</title>
	<atom:link href="http://imprompt.us/feed/" rel="self" type="application/rss+xml" />
	<link>http://imprompt.us</link>
	<description>Computer Science and Teaching and Other Ancillary Things</description>
	<lastBuildDate>Tue, 06 Jul 2010 17:28:56 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>Current Projects</title>
		<link>http://imprompt.us/2010/current-projects/</link>
		<comments>http://imprompt.us/2010/current-projects/#comments</comments>
		<pubDate>Tue, 06 Jul 2010 17:28:56 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=210</guid>
		<description><![CDATA[My current projects list is out of control. I have replicated it below, with project statuses. Internet Topology It got me a PhD, and now its just sitting there. I haven&#8217;t touched it since my talk @Google, but it needs to get (re)written up and submitted to an actual journal. Status: only barely able to [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/current-projects/feed/</wfw:commentRss>
		<slash:comments>8</slash:comments>
		</item>
		<item>
		<title>BSD Heapsort is busted</title>
		<link>http://imprompt.us/2010/bsd-heapsort-is-busted/</link>
		<comments>http://imprompt.us/2010/bsd-heapsort-is-busted/#comments</comments>
		<pubDate>Thu, 01 Jul 2010 22:23:26 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=207</guid>
		<description><![CDATA[And so are many other sorts, I bet. The libbsd heapsort can&#8217;t sort an array that is larger than 2 Gb. This is probably because they have a line somewhere like if (2*i+1 &#62; size) and with a 2Gb region, 2*i will overflow and return a negative number. It is a very strange experience to [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/bsd-heapsort-is-busted/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>It&#8217;s 2010, and mass storage still sucks</title>
		<link>http://imprompt.us/2010/its-2010-and-mass-storage-still-sucks/</link>
		<comments>http://imprompt.us/2010/its-2010-and-mass-storage-still-sucks/#comments</comments>
		<pubDate>Wed, 30 Jun 2010 16:22:58 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=205</guid>
		<description><![CDATA[Let me tell you how mass storage should work: I stick in a new disk, power on the machine, and then the new disk is there waiting to be written to, having been identified as new and then joined into a storage cluster in which a group of non-identical disks mutually back each other up. [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/its-2010-and-mass-storage-still-sucks/feed/</wfw:commentRss>
		<slash:comments>13</slash:comments>
		</item>
		<item>
		<title>Ulam spiral, take 2</title>
		<link>http://imprompt.us/2010/ulam-spiral-take-2/</link>
		<comments>http://imprompt.us/2010/ulam-spiral-take-2/#comments</comments>
		<pubDate>Fri, 07 May 2010 21:19:34 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=200</guid>
		<description><![CDATA[Mostly this is posted for its pleasantly recursive nature. In response to many people asking me how I made the Ulam Spiral, I have produced a a PDF of the spiral which includes the code to make said PDF. I really like how it turned out. One subtle touch that fellow Python programmers will appreciate [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/ulam-spiral-take-2/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Ulam Spiral Algorithm</title>
		<link>http://imprompt.us/2010/ulam-spiral-algorithm/</link>
		<comments>http://imprompt.us/2010/ulam-spiral-algorithm/#comments</comments>
		<pubDate>Thu, 06 May 2010 06:02:03 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=193</guid>
		<description><![CDATA[I looked at many things online which detail how to draw the Ulam Spiral, and all of them use various bad-sounding algorithms. I recently drew the Ulam Spiral and it went very quickly and the algorithm I used was both straightforward and basic-sounding. So I will reproduce it below so that others won&#8217;t have to [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/ulam-spiral-algorithm/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Sieve of Eratosthenes</title>
		<link>http://imprompt.us/2010/sieve-of-eratosthenes/</link>
		<comments>http://imprompt.us/2010/sieve-of-eratosthenes/#comments</comments>
		<pubDate>Mon, 26 Apr 2010 22:36:11 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=189</guid>
		<description><![CDATA[The Sieve of Eratosthenes, implemented lazily in Python def integers_from(start): &#160; &#160; x = start &#160; &#160; while 1: &#160; &#160; &#160; &#160; yield x &#160; &#160; &#160; &#160; x += 1 def filter_out_multiples(stream, f): &#160; &#160; return (i for i in stream if i%f != 0) numbers = (i for i in integers_from(2)) while [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/sieve-of-eratosthenes/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>The Discoveries</title>
		<link>http://imprompt.us/2010/the-discoveries/</link>
		<comments>http://imprompt.us/2010/the-discoveries/#comments</comments>
		<pubDate>Sun, 25 Apr 2010 18:15:48 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=178</guid>
		<description><![CDATA[I&#8217;ve been reading books on the subway too and from work. It is wonderful. I&#8217;ve been alternating between books of quality, and trashy scifi. I just finished my most recent &#8220;quality&#8221; book, and highly recommend it to all my fellow science nerds and enthusiasts. In The Discoveries, Alan Lightman has collected the most groundbreaking scientific [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/the-discoveries/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Generate a random true boolean lisp statement</title>
		<link>http://imprompt.us/2010/generate-a-random-true-boolean-lisp-statement/</link>
		<comments>http://imprompt.us/2010/generate-a-random-true-boolean-lisp-statement/#comments</comments>
		<pubDate>Sun, 25 Apr 2010 04:11:07 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=173</guid>
		<description><![CDATA[Just in case you want generate a random tautology, you can find python code to do so at: http://pastie.org/933675. It&#8217;s actually pretty sweet &#8211; it won&#8217;t generate all true statements, but it will generate all tautologies of a given depth. Also, it has some clever hacks that allow it to be random (instead of true) [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/generate-a-random-true-boolean-lisp-statement/feed/</wfw:commentRss>
		<slash:comments>14</slash:comments>
		</item>
		<item>
		<title>Biases in Curricula Design</title>
		<link>http://imprompt.us/2010/biases-in-curricula-design/</link>
		<comments>http://imprompt.us/2010/biases-in-curricula-design/#comments</comments>
		<pubDate>Tue, 06 Apr 2010 21:40:54 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=165</guid>
		<description><![CDATA[In Mindstorms (the groundbreaking book, not the Lego set) Seymour Papert writes that part of what drives the mathematical curriculum is the technology available to students. As I see it, a major factor that determined what mathematics went into school math was what could be done in the setting of school classrooms with the primitive [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/biases-in-curricula-design/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Ada Lovelace Day</title>
		<link>http://imprompt.us/2010/ada-lovelace-day/</link>
		<comments>http://imprompt.us/2010/ada-lovelace-day/#comments</comments>
		<pubDate>Wed, 24 Mar 2010 22:45:30 +0000</pubDate>
		<dc:creator>Peter</dc:creator>
				<category><![CDATA[]]></category>

		<guid isPermaLink="false">http://imprompt.us/?p=163</guid>
		<description><![CDATA[On Ada Lovelace Day, one is encouraged to write about a great woman involved in computer science. That&#8217;s today, and I&#8217;ll take Barbara Liskov! She figured out what she, in her book &#8220;Program Development in Java&#8221;, modestly calls &#8220;the substitution principle&#8221;, but everyone else in the world calls &#8220;the Liskov substitution principle&#8221;. It&#8217;s an insight [...]]]></description>
		<wfw:commentRss>http://imprompt.us/2010/ada-lovelace-day/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
