I lied. I didn't take a break from the internet.

But I've reduced my dose significantly.

I wanted to share something that some of my TA staff for the complexity theory course put together. On the final exam, we assigned an extra credit problem which was to prove or disprove that P = NP. We told the students that credit would be given for ( Read more... )

Back in the CIT TA room, within which the passage of time is imperceptible.

I don't know if I've mention this yet, but this semester, I'm head TAing a course of theory of computation. It's pretty basic, since it's the required course for CS majors who would rather stay the hell away from proofs. It gets an odd mix of those who are required to ( Read more... )