[KongchangAI]
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

Cite This Claim

Stable URI
https://kongchang.com/claim/973495
API
curl https://kongchang.com/api/v1/knowledge/claims/973495
MCP
get_claim(id=973495)