Unverified50% confidenceFactExact time
A standard Transformer has no recurrent structure; its forward computation is a finite-depth network stacked layer by layer, with no hidden-state passing across time steps.
1
Sources
50%
Confidence
Long-term
Relevance
11/13/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.70% similarUnverifiedResearch 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⁰).64% similarUnverifiedRELAGRAM's edge token encoding is not tied to the total number of nodes, and the parameter count of the recursive Transformer is independent of instance scale, enabling it to achieve cross-scale transfer.62% 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% similarUnverifiedIn a standard Transformer, the input and output dimensions of each sublayer and the residual addition are all done in the same d-dimensional space, causing the residual width to be implicitly coupled with the computation width.60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1166035API
curl https://kongchang.com/api/v1/knowledge/claims/1166035MCP
get_claim(id=1166035)