arXiv (All)
open access
Fixing the Fixpoint: A Formal Theory of Convergence Detection for Incremental Recursive Computation
Modern incremental computation theories like DBSP have enabled efficient incrementalization of general recursive computations. To do so, they require a runtime Fixpoint Detection (FPD) mechanism to detect whether an iterative computation has reached the fixpoint and thus should terminate. However, w
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
- Fixing the Fixpoint: A Formal Theory of Convergence Detection for Incremental Recursive Computation#1169672
- Computational Complexity of Alignments#1142636
- A Historical Corpus Is Not a Historical System: Auditing Hindsight Leakage in Stateful Data Discovery#1070235
- Constraint Drift: Pre-Closure Behaviour in Admissible Systems#729288
- The Revision Function Under Pressure: _Stress-Testing Recursive Ethics Against Its Own Failure Conditions_#243077
Record · ID 1155465
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