MIT OpenCourseWare
open access
CC BY-NC-SA
Topics in Theoretical Computer Science: Probabilistically Checkable Proofs
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
- Conditionalization Does Not Maximize Expected Accuracy#715689
- Algorithmic Randomness, Exchangeability, and the Principal Principle#694494
- Probabilistic Regresses and the Availability Problem for Infinitism#761165
- Dicey games: Shared sources of randomness in distributed systems#449044
- Accuracy and Probabilism in Infinite Domains#118183
Record · ID 67037
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