SYSE.51:4.1 - Name feasible moves and actual limits

Recover the receiving result, protected effects, time and resource limits, and the minimum means needed for execution, result checking and a usable return. Distinguish a preference for lower cost from an enforced cap. State which resource is limiting; human time, fatigue, attention demands, physical effort, token count, latency, money, concurrency and tool quotas need their own applicable measures or limits. Do not convert them into one universal effort scale.

List the moves actually available to the performer at decision points and their relevant cost uncertainty: a written check, calculator use, a source observation, a domain computation, another sample, a branch or a stronger or cheaper endpoint. Name the unresolved comparison each move could change. A more capable endpoint is not an available move without the necessary access and supported interface.

Use C.11/C.11.DUA to frame the choice and value of resolving uncertainty; CMP.4 supplies an actual search procedure when search is selected. SYSE.39 includes preparation, evaluation and maintenance in the burden comparison. SYSE.40 enforces the feasible limits. This Method constructs the trajectory-dependent allocation that consumes those results.