Bounded-loop runtime implementing the Lutar Invariant Λ. Audit-closure operator with sub-millisecond per-request overhead. 172/172 tests, Apache-2.0.
-
Updated
May 12, 2026 - TypeScript
Bounded-loop runtime implementing the Lutar Invariant Λ. Audit-closure operator with sub-millisecond per-request overhead. 172/172 tests, Apache-2.0.
The Ouroboros Thesis — peer-reviewable preprints on bounded recursive computation and audit-closure operators for governed AI. Zenodo DOI-pinned. CC BY 4.0.
Add a description, image, and links to the bounded-recursion topic page so that developers can more easily learn about it.
To associate your repository with the bounded-recursion topic, visit your repo's landing page and select "manage topics."