Agent Complexity Theory Directory

Type: kb/types/index.md

← Parent

• Adaptive dependencies force width, reopening, or sequential rounds (note) - Exact orchestration over step-dependent discovery and dense cross-item interactions must pay in prompt width, repeated reopening, or sequential rounds; parallel fan-out alone cannot remove the dependency cost
• Exact retrieval over semantically opaque items requires linear inspection (structured-claim) - Worst-case lower bound for opaque retrieval — without a pre-built pointer layer, exact discovery of all relevant items requires linear semantic inspection
• Few calls require width and long chains require verification (note) - Decomposition sits on a width-loss-reliability frontier: exact short pipelines need wide prompts or high-bandwidth interfaces, while long unchecked chains accumulate error and therefore need verifier or redundancy stages
• No universal distillation preserves all task-relevant structure (structured-claim) - Counting lower bound on summary-based memory — exact universal answering over a rich query family requires summary space at least as large as the query-induced state partition