I've been grading tests. Here are some of the fun comments I made:
Student: "Consider the language L={a,b | a! = b} (factorial), this can obviously not be recognized in 2n steps."
Me: "Really? There is a O(n (log n log log n)2) algorithm for factorials. Ooooo. Burn!"
Student: "If the TM had only 1 state, and the size of the alphabet = 2 it would appear more like 2|w|..."
Me: "That's crazy talk."
Student: Long answer...
Me: "So close, but then you went on a tangent instead of hitting the answer."
Student: "The answer is Yesssssss but only 7 s's because too many s's will mean less mercy points if I'm wrong."
Me: "Sorry, check your coin again."
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment