Study deck / task 1.1

Control the loop with evidence

Domain 1 decks

problem / slide 1 of 5

A loop is a state machine, not a conversation guess

The application sends a request, inspects the structural result, executes requested tools, returns their results, and repeats. Completion is a state, not a phrase.

Structural termination

Why it matters

Prose can coexist with a tool request, so application control must follow the response state rather than words that sound final.

Example

An answer says “I found the order” and includes a refund-status tool call; the loop still owes that call a result.

Slide 1 of 5

Slides and flashcards cover the same concepts. Read the lesson for full detail.

Read the full 1.1 lesson