Unverified50% confidenceFactExact time
The busy beaver function BB(n) is defined as the maximum number of 1s that an n-state, two-symbol Turing machine can write when it finally halts.
1
Sources
50%
Confidence
Long-term
Relevance
10/13/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn n8n, when an upstream node produces N items, the downstream node executes N times — this is the default design logic, not a bug.68% similarUnverifiedn8n uses a per-run billing model, where running a workflow once counts as one execution regardless of how many steps the workflow has.61% similarUnverifiedIn an Agent loop, the full context must be sent as input each round; the input token count for round N is approximately C + (N-1) × (O + F), growing linearly or super-linearly with the number of rounds.60% similarUnverifiedThe Loop specification defines five termination states: Success, No-op, Blocked, Stalled, and Exhausted.59% similarUnverifiedThe applicable boundary of n8n is: automation only makes sense when a task occurs repeatedly and has clear rules to follow.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1019206API
curl https://kongchang.com/api/v1/knowledge/claims/1019206MCP
get_claim(id=1019206)