arXiv (All)
open access
Constant-Coin Complete-Information Debates for $\mathsf{P}$ with Arbitrarily Small Strong Error
We study complete-information debate systems in which a probabilistic finite-state verifier reads the alternating messages of a prover and a refuter. Demirci, Say, and Yakaryılmaz showed that every language in $\mathsf{P}$ has such debates checkable with a constant number of random bits and arbitrar
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
- Arithmetic Judgements, First-Person Judgements and Immunity to Error Through Misidentification#758712
- Imprecise Probability and the Measurement of Keynes's "Weight of Arguments"#759590
- Experimental work on the norms of assertion#774004
- Examination as Bounded Inference: An Ontology of the Ideal Examination and Its Deviations#244957
- Upping the Ex Ante Problem for Reliabilism#735117
Record · ID 1050453
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