Agent Complexity Theory Directory

Type: kb/types/index.md

← Parent

• A toy model of archive readability
• 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 bounded summary preserves all distinctions for a rich query family (structured-claim) - Counting lower bound on bounded summaries: exact answering over a query family requires at least one summary code per query-induced answer profile