I must be going for a record or something...

So, another new post.

Today I have to present on ternary (or trinary) computing as opposed to binary computing. Part of the interesting applications have to do with the fact that optical computers (which use photons rather than electrons) could implement ternary systems to make vastly faster computers, because we've almost maxed out what we can make the electron do. We need to branch differently.

Anyway, one of the advantages to optical computers are that the photons would move faster than electrons can in circuits (electrons go much slower than the speed of light when moving through copper, for example). Also, photons have higher bandwidth. I puzzled over that for quite a while.

At first I (for some reason) decided that it must be because photons have more mass. But they're massless (duh). Then I looked into what particle bandwidth is (thanks, wikipedia!) and it basically depends on the spectral linewidth of a particle (in this situation). Since electrons have small linewidths because they move into discrete states and photons have a huge spectrum they can move around in, their bandwidth is greater. See, I was thinking about bandwidth in terms of internet speed and that was my hangup.

Silly me.

Anyway, watch this video, it's GREAT:

I'm so unreliable about this...

Okay, so I have been told to update and I have known for a while that it was time to do so, but I've been crazy crazy busy. I still am, actually, but I have decided that this is worthwhile enough to blog about.

Okay, so in my Discrete Structures class (which is killing me), I have been spending the entire semester studying math. I get that it's supposed to be mathy, though, so I accept that for what it is. The problem is the caliber of the problems given the class. The average homework assignment takes me four hours and two trips to o

ffice hours. That isn't too bad, but I don't think I'm learning things properly. On the last exam, for example, I got a 50. Out of a hundred. And the class average on the exam was a 50. I would be the type of person to put it all on the professor, but he gave us the option to redo it for half the points we lost, and as I look it back over it seems really simple. For example, the last problem totally stumped me. I just looked at it again, and I could readily see why n*2^(n-1) is equal to the sum of k going from one to n of k C(n,

k). I would format that better, but I don't know how to do so on this. Instead of erasing anything, I'll just go do it in Word and see if I can append it here in that way (starting time 12:37 p.m. EST, let's see how long it takes me to do this in Word).

Well, that took me until 12:51 to do. The new Word makes things hard to find and makes me miss OpenOffice. Ho hum. Anyway, the answer is to use the binomial theorem trickily and then take the derivative of both sides. I won't go into all the details because a) it's boring and b) I'd hate for it to look like I was facilitating plagiarism. Rest assured, though, that it is very provable (laughably so, in fact).

Anyway, there's a really funny show called It Only Hurts When I Laugh, and it's like AFV, but there are more videos that actually make you laugh and people fall down a lot. I like when people fall down, and I don't know why. Look into it. In the mean time, watch this: