GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
NeurIPS 2025

The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity

Controlled puzzles expose limits in long reasoning traces. Learn what the failures show, how later revisions address critiques and how to build a more diagnostic agent evaluation.

Breakdown by FDE Interviews · 9 min read · Updated

About the original · 2025
AUTHORS
Shojaee, Mirzadeh, Alizadeh, Horton, Bengio, Farajtabar
FROM
Apple
PUBLISHED
Jun 2025 · NeurIPS 2025
IN THIS BREAKDOWN · 10 SECTIONS

You can read 17% of this breakdown.

01

The paper in one minute

This paper evaluates reasoning models on puzzles whose size can be varied while their rules remain stable. Instead of scoring only a final answer, the authors extract candidate plans and execute them in simulators. That reveals illegal transitions, incomplete plans and the point at which an apparently plausible solution stops working.

The tested models show different behavior at different difficulty levels. Extra thinking can help in an intermediate range, while harder instances eventually produce severe accuracy declines. Longer reasoning traces do not reliably prevent those failures, and the authors observe reduced thinking-token use beyond some difficulty thresholds.

The result is evidence about particular models, prompts and puzzle tasks. It is not a proof that all language models lack reasoning, that tool-using agents cannot solve these problems, or that future models must fail at the same threshold. Those are broader claims than this experiment can establish.

This page uses the November 2025 camera-ready revision. Its appendix responds to critiques of the original June paper and narrows some experimental ranges. Reading that revision matters because repeating the initial controversy without the later controls gives an incomplete account of the evidence.

THE IDEA, VISUALLY
IDENTIFY WHICH PART OF THE TASK FAILED Describe a procedure Is the algorithm valid? Execute each move Does every transition obey rules? Return the required form Complete and parseable? Exact Hanoi output requirement Minimum moves = 2^n − 1. Program length and enumerated output length are different quantities. 4 disks 15 moves 8 disks 255 moves 12 disks 4,095 moves Report illegal moves, truncation and parse failures separately. A compact correct program is useful evidence, but it does not demonstrate reliable unaided enumeration.
Our diagnostic separates algorithm construction, exact execution and output representation. Hanoi counts are mathematically derived; the diagram does not invent model accuracy curves.
Research notes: the problem, approach and results
Four

controlled puzzle families

25

samples per instance and complexity level, appendix A.3

2^n − 1

minimum Hanoi moves; exact mathematical requirement

THE PROBLEM

Final benchmark scores can hide where long reasoning and exact execution fail.

THE IDEA

Vary puzzle difficulty and validate both final plans and extractable intermediate attempts with simulators.

THE RESULT

The tested models show task-dependent failure regimes; interpretation requires attention to representation, solvability and the revised experiments.

02

Why it matters to an FDE

An enterprise agent can explain a sensible procedure and still violate a constraint halfway through execution. A migration plan might name the right steps but perform them in the wrong order. A reconciliation workflow might preserve totals initially and then lose track of one exception.

The paper suggests a useful evaluation habit: inspect state transitions and first failures, not only the final narrative. It also shows why spending more inference tokens is an intervention to test rather than a general reliability guarantee.

Connect agent trajectory evaluation with benchmark limitations. A production test should separate planning, tool execution, output formatting and recovery. The customer needs a correct completed workflow; understanding which component fails is what lets an FDE improve that outcome.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 199 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>2 runnable code blocks
  • ▦3 results tables
  1. 03Key takeaways

    Six distinctions for interpreting reasoning failures and designing a useful evaluation

    Free account
  2. 04How it works

    Follow controlled instance generation, plan extraction and simulator-based failure analysis

    Premium
  3. 05The numbers that matter

    Use exact task counts and reported setup details without inventing a universal reasoning threshold

    Premium
  4. 06Try it yourself

    Build a stateful verifier that distinguishes complete, incomplete, illegal and malformed plans

    Premium
  5. 07Where it breaks

    Read the published critique alongside the revised paper and keep conclusions within the evidence

    Premium
  6. 08Using it on a deployment

    Apply the paper's diagnostic method to customer workflows with explicit states and invariants

    Premium
  7. 09Interview angles

    Explain why an evaluation failure needs a diagnosis before it becomes a claim about model capability

    Premium
Back to the paper library →