eScholarship
metadata only
CC BY
Probability learning with noncontingent success
A noncontingent success (NCS) reinforcement schedule for binary prediction is one in which the subject has the same probability (δ) of being correct regardless of which response he makes. These schedules may be contrasted with the more commonly studied noncontingent event (NCE) schedules in which th
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
- Anytime-Valid Monitoring of Robust Stochastic Models#1401370
- Randomness Is Unpredictability#725122
- Absolutely No Free Lunches!#700401
- Exact Distinguishability in Non-Markovian Decision Processes#1156799
- OpenJev-RLCD: A Working RLCD Implementation#1143451
Record · ID 1424894
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