๋ฌธ์ œ์˜ ๋‚œ์ด๋„๋ฅผ ์ตœ์†Œ ์ด๋™ํšŸ์ˆ˜๋กœ ์ •์˜ํ•œ ๊ฒƒ์—๋„ ๋ฌธ์ œ๊ฐ€ ์žˆ๋‹ค๋Š” ์ง€์ ์ด ์žˆ์Šต๋‹ˆ๋‹ค. ํ•˜๋…ธ์ด์˜ ํƒ‘์€ ์ •ํ•ด์ง„ ๊ธธ๋งŒ ๋”ฐ๋ผ๊ฐ€๋ฉด ํ’€๋ฆฌ๋Š” ๋ฌธ์ œ์ง€๋งŒ, ๊ฐ• ๊ฑด๋„ˆ๊ธฐ ๋“ฑ ๋‹ค๋ฅธ ๋ฌธ์ œ๋Š” ๋งค๋ฒˆ ์ด๋™ํ•  ๋•Œ๋งˆ๋‹ค ์—ฌ๋Ÿฌ ๊ฐ€์ง€ ์„ ํƒ์ง€๊ฐ€ ๋‚˜์˜ค๊ธฐ ๋•Œ๋ฌธ์— ๋ชจ๋“  ๊ฒฝ์šฐ์˜ ์ˆ˜๋ฅผ ํ™•์ธํ•ด๋ด์•ผ ํ•˜๋Š”๋ฐ ์›๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ๋ฌธ์ œ์˜ ๋‹ต์„ ํƒ์ƒ‰ํ•˜๋Š” ๋‚œ์ด๋„๋ฅผ ๊ณ ๋ คํ•˜์ง€ ์•Š๊ณ  ์žˆ์Šต๋‹ˆ๋‹ค.

๊ฐ™์€ ๋…ผ๋ฌธ ๋ฐœ์ทŒ:

6 Reevaluating Complexity Claims

The authors use "compositional depth" (minimum moves) as their complexity metric, but this conflates mechanical execution with problem-solving difficulty:

Table 1: Problem complexity is not determined by solution length alone

Tower of Hanoi
* Solution Length: 2^N - 1
* Branching Factor: 1
* Search Required: No

River Crossing
* Solution Length: ~4N
* Branching Factor: >4
* Search Required: Yes (NP-hard)

Blocks World
* Solution Length: ~2N
* Branching Factor: O(N^2)
* Search Required: Yes (PSPACE)

Tower of Hanoi, despite requiring exponentially many moves, has a trivial O(1) decision process per move. River Crossing, with far fewer moves, requires complex constraint satisfaction and search. This explains why models might execute 100+ Hanoi moves while failing on 5-move River Crossing problems.
0

If you have a fediverse account, you can quote this note from your own instance. Search https://bsky.brid.gy/convert/ap/at://did:plc:ppk763j7o2wkinvzuqx4orrb/app.bsky.feed.post/3lrpqr6rn7c24 on your instance and quote it. (Note that quoting is not supported in Mastodon.)