Tuesday, April 14, 2015
Recursive Structure of Hofstadter Sequences
›
I'm slowly (but surely!) making my way through Godel, Escher, Bach: An Eternal Golden Braid by Douglas Hofstadter. As I've mention...
5 comments:
Monday, March 9, 2015
Horner's Rule for Polynomial Computation
›
Suppose I had a polynomial a n x n + a n-1 x n-1 + … + a 1 x + a 0 , and a point x * at which I wanted to evaluate t...
Thursday, February 26, 2015
Hofstadter's MIU System
›
A different sort of blog post today: I figured we'd take a quick break from SICP and have a look at a puzzle from another book I'v...
Saturday, February 14, 2015
The N-Queens Puzzle and 0-1 Integer Linear Programming
›
We saw in the last post how we can tackle the N-Queens Puzzle recursively by considering each column in turn. This way, we can generate al...
2 comments:
Thursday, February 5, 2015
The N-Queens Puzzle and Recursion
›
One of the cooler exercises from the Structure and Interpretation of Computer Programs is Exercise 2.42 : finding solutions to the N-Queen...
2 comments:
Thursday, January 29, 2015
Higher-Order Functions and Accumulation
›
The notion of a higher-order function – that is, a function that operates on other functions – is a fundamental idea i...
Saturday, January 24, 2015
Newton's Method
›
As a follow-up from the previous post dealing with fixed-point iteration , another particularly useful family of numerical techniques de...
›
Home
View web version