Unverified50% confidenceFactExact time
In computer science, a termination predicate is a judgment expression that must eventually become true for a loop or recursion to stop; if the termination predicate does not hold in any reachable state, it is an infinite loop.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe three common termination conditions for an agent loop are: the model gives a response that no longer calls any tool, the step limit is reached, or human approval is awaited.70% similarUnverifiedThe Loop specification defines five termination states: Success, No-op, Blocked, Stalled, and Exhausted.69% similarUnverifiedThe number of recurrent iterations can be determined by a fixed value, or by introducing an adaptive stopping mechanism similar to Adaptive Computation Time that allows the model to decide when to stop.68% similarUnverifiedSetting a token cap on the thinking process, or forcing an interruption when repetitive patterns are detected, is a practical means of preventing infinite reasoning loops.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1006811API
curl https://kongchang.com/api/v1/knowledge/claims/1006811MCP
get_claim(id=1006811)