Unverified50% confidenceFactExact time
Research by Merrill & Sabharwal in 2023 theoretically proved that a fixed-depth Transformer, without allowing intermediate outputs, cannot determine whether a path exceeding a certain threshold length exists between two nodes in a graph (corresponding to the limitation of the computational complexity class TC⁰).
1
Sources
50%
Confidence
Long-term
Relevance
10/4/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe standard Transformer is a feedforward deep-stacking architecture with a fixed depth of reasoning, passing through the same number of computational layers regardless of whether the problem is simple or complex.67% similarUnverifiedUniversal Transformer uses weight tying to allow all recurrent steps to reuse the same set of parameters, increasing computational depth without increasing the parameter count.60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/973495API
curl https://kongchang.com/api/v1/knowledge/claims/973495MCP
get_claim(id=973495)