News for hackers. Stuff that matters.
Re:Poh-Shen Loh: GPT-o1 got a perfect score on my CMU underg... by The_suffocated on Sunday March 16, 2025 @08:06AM (#43378365)

   > I showed the exam to one of our math Ph.D. students (a former International Mathematical Olympiad Gold Medalist from Belarus), and he said "Hmm. Non-Trivial. Good." Our undergraduate students are also very good. This exam was not easy for them, as the score distribution shows.
The questions themselves (except probably the fifth) seem pretty standard. I wonder how the math olympiad medalist mentioned in the tweet would think that they are non-trivial. I am no expert in recurrence relation and haven’t done any exercise for decades, but even someone as lame and as out of touch as I was able to solve the first four problems in less than an hour.

I actually think that the students performed quite well. It was an exam. They were under stress. The median score appears to be around 35 (out of 50). If the questions were really non-trivial, I would even say that the students’ performance was excellent.

What surprised me was neither the performance of GPT-o1 nor that of the students, but the content of the exam. Why would anyone put FIVE questions on recurrence relations in one exam? This is unthinkable.

There are no comments on this comment yet.