<?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>Rosio Pavoris &#187; CompSci</title>
	<atom:link href="http://cairnarvon.rotahall.org/category/academia/compsci/feed/" rel="self" type="application/rss+xml" />
	<link>http://cairnarvon.rotahall.org</link>
	<description>Unscientific and ultimately destructive.</description>
	<lastBuildDate>Fri, 30 Jul 2010 05:28:39 +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>Processing constraints is easy</title>
		<link>http://cairnarvon.rotahall.org/2010/06/20/processing-constraints-is-easy/</link>
		<comments>http://cairnarvon.rotahall.org/2010/06/20/processing-constraints-is-easy/#comments</comments>
		<pubDate>Sun, 20 Jun 2010 04:39:44 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1816</guid>
		<description><![CDATA[Alright, we&#8217;ve covered search trees in some detail, and they work great for problems where we have clear states and rules of production to move from one state to the next. Sometimes that&#8217;s not a very convenient way to state a problem, though, and a more natural way to think about things is as a [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2010/06/20/processing-constraints-is-easy/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Julia settee</title>
		<link>http://cairnarvon.rotahall.org/2010/04/16/julia-settee/</link>
		<comments>http://cairnarvon.rotahall.org/2010/04/16/julia-settee/#comments</comments>
		<pubDate>Fri, 16 Apr 2010 21:47:49 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1746</guid>
		<description><![CDATA[I&#8217;ve written this, so I might as well share it. In my post on the Mandelbrot set earlier, I mentioned the Julia sets of the quadratic polynomial fc(z) = z2 + c where c is a given (constant) complex number and z are the points of the complex plane. Because I wanted to visualise how [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2010/04/16/julia-settee/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Playing games is easy</title>
		<link>http://cairnarvon.rotahall.org/2010/04/06/playing-games-is-easy/</link>
		<comments>http://cairnarvon.rotahall.org/2010/04/06/playing-games-is-easy/#comments</comments>
		<pubDate>Tue, 06 Apr 2010 13:32:47 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1735</guid>
		<description><![CDATA[People who take an active interest in AI are quite unlikely to have very many friends, so it should come as no surprise that trying to get computers to play games has always been a popular subfield of AI. Traditionally that game has mostly been chess, but I feel chess has a grinding tedium to [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2010/04/06/playing-games-is-easy/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Optimal search is easy</title>
		<link>http://cairnarvon.rotahall.org/2010/03/05/optimal-search-is-easy/</link>
		<comments>http://cairnarvon.rotahall.org/2010/03/05/optimal-search-is-easy/#comments</comments>
		<pubDate>Thu, 04 Mar 2010 23:37:45 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1697</guid>
		<description><![CDATA[Last time we looked at how to solve the eight puzzle using the hill climbing algorithm, which gave us a result much more quickly than a blind depth-first search did, but we wondered if the solution we found was the best we could do, and we asked if there was a way to use heuristics [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2010/03/05/optimal-search-is-easy/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Heuristics are easy</title>
		<link>http://cairnarvon.rotahall.org/2010/03/02/heuristics-are-easy/</link>
		<comments>http://cairnarvon.rotahall.org/2010/03/02/heuristics-are-easy/#comments</comments>
		<pubDate>Tue, 02 Mar 2010 18:18:31 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1683</guid>
		<description><![CDATA[(This post assumes you read the previous one.) Today we&#8217;ll be looking at the hill climbing algorithm, which is just a plain old depth-first search with heuristics added. &#8220;Heuristics&#8221; is a fancy word (from the Greek εὑρίσκω, &#8220;I discover&#8221;) for a very simple concept. In the context of search trees, it simply means that at [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2010/03/02/heuristics-are-easy/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Search trees are easy</title>
		<link>http://cairnarvon.rotahall.org/2010/02/28/search-trees-are-easy/</link>
		<comments>http://cairnarvon.rotahall.org/2010/02/28/search-trees-are-easy/#comments</comments>
		<pubDate>Sun, 28 Feb 2010 16:35:12 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1671</guid>
		<description><![CDATA[A decent proportion of my readers are noobie programmers or people who aren&#8217;t in a position to receive a formal CS education, so I thought I&#8217;d cover the basics of a fundamental concept most people cover in their first semester of algorithms or AI today: search trees. The fact that my college considers this to [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2010/02/28/search-trees-are-easy/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Cisco sucks at crypto</title>
		<link>http://cairnarvon.rotahall.org/2009/12/01/cisco-sucks-at-crypto/</link>
		<comments>http://cairnarvon.rotahall.org/2009/12/01/cisco-sucks-at-crypto/#comments</comments>
		<pubDate>Tue, 01 Dec 2009 00:26:07 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[Cryptography]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1606</guid>
		<description><![CDATA[I&#8217;m in a class called Netwerkbeheer (Network Management), which spans two semesters and is a transparent excuse to peddle CCNA certifications. As a result, I spend a lot of time playing with Cisco routers and switches, and one of the many, many things that annoy me about Cisco&#8217;s IOS is their cavalier attitude towards security [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2009/12/01/cisco-sucks-at-crypto/feed/</wfw:commentRss>
		<slash:comments>10</slash:comments>
		</item>
		<item>
		<title>Literate Tripcrackers</title>
		<link>http://cairnarvon.rotahall.org/2009/04/07/literate-tripcrackers/</link>
		<comments>http://cairnarvon.rotahall.org/2009/04/07/literate-tripcrackers/#comments</comments>
		<pubDate>Tue, 07 Apr 2009 15:39:19 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[Cryptography]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1352</guid>
		<description><![CDATA[There&#8217;s been some interest in tripcode crackers lately, so I thought I&#8217;d write on in Haskell. I mentioned this before, but I&#8217;ve improved it a bit since. I&#8217;ll be discussing the code step by step in this post. By the end, we should have a working application that takes a POSIX regex as an argument, [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2009/04/07/literate-tripcrackers/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Forced indentation of Huffman encoding</title>
		<link>http://cairnarvon.rotahall.org/2009/03/03/forced-indentation-of-huffman-encoding/</link>
		<comments>http://cairnarvon.rotahall.org/2009/03/03/forced-indentation-of-huffman-encoding/#comments</comments>
		<pubDate>Tue, 03 Mar 2009 10:39:39 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1314</guid>
		<description><![CDATA[Inspired by rmuser&#8217;s Youtube videos on information theory (and specifically the one about Huffman encoding), I wrote a Python script to calculate a Huffman encoding for text. It reads input from stdin (preferably in ASCII), calculates a Huffman mapping, and shows it to you. It also calculates how long the text would be if encoded [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2009/03/03/forced-indentation-of-huffman-encoding/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>The Sieve of Eratosthenes</title>
		<link>http://cairnarvon.rotahall.org/2008/12/14/the-sieve-of-eratosthenes/</link>
		<comments>http://cairnarvon.rotahall.org/2008/12/14/the-sieve-of-eratosthenes/#comments</comments>
		<pubDate>Sun, 14 Dec 2008 23:05:34 +0000</pubDate>
		<dc:creator>Cairnarvon</dc:creator>
				<category><![CDATA[CompSci]]></category>
		<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cairnarvon.rotahall.org/?p=1219</guid>
		<description><![CDATA[Prime numbers are ridiculously important in cryptography, and I recently found myself needing a way to generate them (for a toy implementation of the Diffie-Hellman key exchange algorithm). It keeps amazing me how few languages actually have libraries for generating prime numbers, or even just for primality testing. Because I didn&#8217;t feel like thinking, and [...]]]></description>
		<wfw:commentRss>http://cairnarvon.rotahall.org/2008/12/14/the-sieve-of-eratosthenes/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>

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