SNW played at Nolan’s birthday party:
01
02
03
04
05
06
07
08
09
10
11
12
13
14 – When You Love
15
16 – Layers
17
18
19
20
The session was pretty good. We were solid, pretty together, and groovy. My biggest problem with it is that we sounded a lot more like a “jam band” than usual. I have a conjecture: pot + guitar = jam band.
That [...]
You don’t need any fancy graphics plotter to draw fractals. You can just use Mathematica’s (fancy-schmancy) typesetter. I entered the following into Mathematica:
And I got this.
I’m just learning about SQL. I have this query:
SELECT div.number
FROM divisors div
WHERE 0 = (SELECT COUNT(*)
FROM divisors t
, numdivisors(div.number) djn
WHERE t.number < div.number
AND numdivisors(t.number) >= djn)
GROUP BY div.number
Where numdivisors is defined as:
CREATE FUNCTION numdivisors(integer)
RETURNS bigint [...]
I just posted an article where I needed to use the (ugh) C preprocessor in a Haskell program. Well, thank the gud lawd that’s not true. I remembered learning about the existence of Template Haskell some time ago. That means I can abstract the whole Accessor thing out into another module. [...]
Last week I tried to create a board game programming architecture in Haskell. The idea was to base the architecture around specifying an abstract state machine for the game. As we discussed in GameDev this week, abstract state machines aren’t exactly appropriate for games, but they’re close enough that you can make a [...]
I was thinking about game ladder scoring recently. I recall being frustrated at Supreme Commander for putting me lower on the ladder than someone I’ve beaten. I want a ladder algorithm that won’t allow that.
In particular, I want a ladder function l: (P × P → Z) × P → R which assigns [...]
Jude has been working on the design of a general board game programming engine. We brainstormed a bit, and I remembered something I had read about a little while ago: Abstract state machines.
An ASM is really nothing more than a formalization of a simultaneous chain of if-then statements. A common example is Conway’s [...]
I’m about to start a big flash project, so I was looking at Flex. I watched their video demo, and besides obviously leaving out some key steps (such as where the hell that side panel came from—they didn’t make that during the video!), I didn’t really like the RoResque boilerplate approach that they took.
In [...]
I’ve been wondering about “levels of incompleteness”. There might be some cool decidability theory hiding in here. I started the exploration with a few definitions (and haven’t gotten very far):
A recursive set of sentences A is called weakly incomplete if A is incomplete and there is a recursive set of sentences S ⊃ [...]
When I was going to Fairview High School, I spent a lot of time in the basement math annex, a computer lab for math classes which was empty most of the time (except for me and my nerdy friends). There was a game installed on that computer called Green Globs, a little math game [...]
