<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.9.2" -->
<rss version="0.92">
<channel>
	<title>Halfbaked Ideas</title>
	<link>http://erl.nfshost.com</link>
	<description></description>
	<lastBuildDate>Thu, 30 Jul 2009 14:54:30 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Head to Head testing</title>
		<description><![CDATA[
Wally&#8217;s comment is insightful.  Giving a thing a name makes it possible discuss that thing. Witness the enormous discussion of Test Driven Development on the internet.
The purpose of this post is to give a name to a testing practice I have found useful, and to explain why it is useful.  I call the [...]]]></description>
		<link>http://erl.nfshost.com/2009/07/28/head-to-head-testing/</link>
			</item>
	<item>
		<title>Clojuratica announced</title>
		<description><![CDATA[Life is sweet.  Yesterday a friend came by.  He had purchased a Macbook Pro, and wanted to me his Levovo T60 that he no longer needed.  Today Garth Sheldon-Coulson announced Clojuratica, an interface between Clojure and Mathematica.  This is the stuff that software dreams are made of.
]]></description>
		<link>http://erl.nfshost.com/2009/07/27/clojuratica-announced/</link>
			</item>
	<item>
		<title>Clojure bowling problem</title>
		<description><![CDATA[ObjectMentor&#8217;s Uncle Bob posted about learning Clojure via a bowling challenge.  The challenge is to write a program to compute bowling scores.   I decided to give it a go.
I&#8217;m not a bowler, so my first step was to try to understand how bowling scores are computed.  Once I did that, it [...]]]></description>
		<link>http://erl.nfshost.com/2009/07/24/clojure-bowling-problem/</link>
			</item>
	<item>
		<title>My road to Clojure</title>
		<description><![CDATA[I&#8217;ve been studying Clojure, using my standard approach of solving Project Euler problems.  I am very much impressed.  Here&#8217;s why.
Functional Programming
Short of speech itself, mathematics is humanity&#8217;s most powerful and influential symbolic technology. Mathematics makes possible the science that shapes our world-view, and the technology that shapes our world. The central abstraction in [...]]]></description>
		<link>http://erl.nfshost.com/2009/07/18/my-road-to-clojure/</link>
			</item>
	<item>
		<title>The wait is over</title>
		<description><![CDATA[Daniel Weinreb is a man with impeccable Common Lisp credentials. Wikipedia cites him as one of the authors of the original language spec, Common Lisp: The Language, First Edition, and as a cofounder of Symbolics, Inc., makers of legendary lisp machines.  Here is what Weinreb had to say in a comment on Stuart Sierra&#8217;s [...]]]></description>
		<link>http://erl.nfshost.com/2009/07/17/the-wait-is-over/</link>
			</item>
	<item>
		<title>Rebinding Mathematica keys</title>
		<description><![CDATA[Out of the box, Mathematica expects the user to press the SHIFT-RETURN to trigger the evaluation of an expression.  Because of my hard-wired emacs reflexes, I frequently type CONTROL-RETURN instead. Today I finally did something about that. I rebound the SHIFT-RETURN sequence.  
Mathematica does not make that easy to do. I found nothing [...]]]></description>
		<link>http://erl.nfshost.com/2009/06/30/rebinding-mathematica-keys/</link>
			</item>
	<item>
		<title>Selecting random observations from SAS datasets</title>
		<description><![CDATA[Here are some simple ways to extract various types of random samples from SAS datasets, using only base SAS.
Sampling without replacement.
A simple way to select N random elements from a dataset without replacement is to first randomly permute the dataset, and then take the first N elements of the permuted dataset. The process of permuting [...]]]></description>
		<link>http://erl.nfshost.com/2009/06/12/selecting-random-observations-from-sas-datasets/</link>
			</item>
	<item>
		<title>A problem I ran across</title>
		<description><![CDATA[I was chasing links concerning the lack of tail recursion optimization in ruby and ran across a math problem:  
Find the smallest positive integer n such that n % x = x-1 for x from 2 to 18
i.e. The remainder is one less than the divisor for all integral divisors from 2 to 18.

The [...]]]></description>
		<link>http://erl.nfshost.com/2009/05/10/245/</link>
			</item>
	<item>
		<title>The two envelope paradox</title>
		<description><![CDATA[I&#8217;m a sucker for probability puzzles. Here&#8217;s an interesting and unusual one I found on the site of Amos Storkey:
You are taking part in a game show. The host introduces you to two envelopes. He explains carefully that you will get to choose one of the envelopes, and keep the money that it contains. He [...]]]></description>
		<link>http://erl.nfshost.com/2009/03/11/the-two-envelope-paradox/</link>
			</item>
	<item>
		<title>Too lazy to flip coins</title>
		<description><![CDATA[I was helping my daughter with some math homework; one of the problems was to flip three coins and tabulate the number of heads over the course of eighty trials. This struck me as excessively tedious, so I suggested we write a computer simulation instead.
Here it is, in its full glory:
coin := Random[Integer, {0, 1}]
flips [...]]]></description>
		<link>http://erl.nfshost.com/2009/02/24/too-lazy-to-flip-coins/</link>
			</item>
</channel>
</rss>
