Parshin Shojaee, Iman Mirzadeh, Keivan Alizadeh, Maxwell Horton, Samy Bengio, Mehrdad Farajtabar
4 min
This paper investigates the actual reasoning capabilities and limitations of Large Reasoning Models (LRMs) like OpenAI's o1/o3, DeepSeek-R1, and Claude 3.7 Sonnet. While these models are marketed for their advanced 'thinking' processes, the authors argue that current evaluation benchmarks (like math and coding tests) are prone to data contamination and fail to reveal how these models handle varying levels of problem complexity. By using controlled, deterministic puzzle environments—such as the Tower of Hanoi and Blocks World—the researchers systematically manipulate problem difficulty to observe how these models perform and how their internal reasoning traces evolve.
The study identifies three distinct performance regimes based on problem complexity:
By analyzing the internal reasoning traces, the authors found that LRMs often exhibit inefficient behaviors. In simpler tasks, they frequently engage in 'overthinking,' where they continue to explore unnecessary alternatives even after identifying the correct solution. In more complex tasks, they often fixate on early, incorrect paths and fail to self-correct, leading to a total failure to reach the target state. These findings suggest that current LRMs do not possess generalizable algorithmic reasoning but rather rely on patterns that break down when the compositional depth of a problem exceeds their training distribution.
Sam: That's the part I find most striking. You'd expect a system that's genuinely reasoning to produce more steps when the problem is more complex. Why would it produce fewer?
Alex: That's exactly what makes this finding significant. If these models were truly following a logical procedure—like a computer running an algorithm—harder problems would require more steps, not fewer. The fact that the opposite happens suggests their "thinking" isn't really a step-by-step process at all. It looks more like pattern recognition. When the pattern gets too unfamiliar, the system doesn't know how to proceed, so it produces less output rather than more.
Sam: So it's less like a mathematician working through a proof, and more like someone who's good at recognising familiar problem types—but has no real strategy when the problem looks genuinely new.
Alex: That's a fair characterisation, and it's essentially what the paper concludes. The researchers even tested whether giving the model the explicit algorithm—the actual step-by-step instructions for solving the puzzle—would help. It didn't. The models still failed at the same complexity threshold, even when handed the answer method directly.
Sam: That's a sobering result. It means the limitation isn't about information. It's something more fundamental about how these systems process problems.
Alex: It is. And the paper is careful not to overstate this. These models represent a genuine step forward in AI capability. But this research suggests that what we've been calling "reasoning" may be a more brittle process than it appears—one that works well within familiar territory, but doesn't generalise the way human logical thinking does. That's an important distinction to keep in mind as these systems are deployed in more demanding contexts.
Sam: So the next time an AI confidently walks through a complex problem, it's worth asking whether it's actually reasoning through it—or just recognising a pattern it's seen before.
Alex: That's a good question to hold onto. And it's exactly the kind of question this research is designed to help us answer. Thanks for listening to ResearchPod.