Agent Complexity Theory Directory

Type: kb/types/generated-index.md

← Parent

• A toy model of archive readability
• Adaptive dependencies force width, reopening, or sequential rounds (note) - Superseded sketch: the width-independent adaptive-round claim is false; retain the interaction-cut argument and replace adaptivity with a breadth/lookahead tradeoff
• Architectural decision theorems: review and proposed pivot
• 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) - Working frontier note whose interface bound remains useful but whose reliability caveat needs a correlation correction and verifier-spacing replacement
• 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