Dave Kellam

So much for updating regularly. I’ve been busy with this whole moving houses thing and haven’t spent a whole lot of time sitting in front of the box. The move went well for the most part, slightly smaller room, closer to campus though and closer to work for the summer. The landlord was angry that we were taking our time getting everything out of the house, he kept sending around a lackey to piss us off more.

Lackey: You’re going to vacuum right?
Us: Our power is cut off
Lackey: So how are you going to vacuum?
Us: We can’t, the power’s been cut off
Lackey: How are you going to vacuum? The sheet says you’re supposed to vacuum.
Us: Well the sheet also says to leave furniture we don’t want on the front lawn, you’re getting angry at us for that
Lackey: I’ll be back in 45 minutes.

And it went on and on like that. When you’re spending a couple days lugging shit up and down stairs, and you’re tired and irritable because you’ve just finished the exam season, the last thing you need is some stupid fat bitch annoying the hell out of you.

AHHHHHHHHHH. That’s three years of university. How did that happen? I’m starting to feel old now. And now it’s some drinkee drinkee. Starting with some tasty Guinness, followed by some not-so-tasty-but-oh-so-drunkee Olde English. It’s past noon, it’s never too early.

The formal definition of “NP-Complete” uses reductions, or transformations, of one problem to another. Suppose we want to solve a problem P and we already have an algorithm for another problem Q. Suppose we also have a function T that takes an input x for P and produces T(x), an input for Q such that the correct answer for P on x is yes if and only if the correct answer for Q on T(x) is yes. Then, by composing T and the algorithm for Q, we have an algorithm for P.

Simple. Right?

Four exams finished, one left. The last one is algorithms, it should be interesting… i have a fair bit of material to learn.