arXiv (All)
open access
$Ψ$-TM: An Exact Rounds-versus-Queries Trade-off for Pointer Chasing, Machine-Checked in Lean 4
An algorithm that reads its input through queries is adaptive if it may choose a query after seeing the answers to earlier ones. We ask how much adaptivity is worth when queries are issued in rounds. In the model, called $Ψ$-TM, the input is reachable only through an interface that returns the conte
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- GraftDB: Dynamic Folding of Concurrent Analytical Queries#259597
- Epistemic Typing as a PostgreSQL Table Access Method: Adversarial Conflict Resolution Under Confidence Forgery and Sybil Coordination#1131996
- Epistemic Typing as a PostgreSQL Table Access Method: Adversarial Conflict Resolution Under Confidence Forgery and Sybil Coordination#1122214
- PASCAL: A Phase-Aware Shared-Cache Model for Parallel Scans#997387
- Kalypso: Relational LLM Serving#411157
Record · ID 1186370
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive