arXiv (OAI Expanded)
open access
The Stochastic Target Discounted-Sum Problem
The target discounted-sum problem (TDS) asks, given a finite integer alphabet $Σ$, a rational discount factor $λ$, and a rational target $t$, whether some infinite sequence over $Σ$ has discounted sum exactly $t$. This problem remains open and underlies several open questions in automata theory, gam
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
- Reply to the Comment on "The Axiom of Choice and the No-Signalling Principle"#927617
- Function-Coherent Gambles#730972
- Conditionalization Does Not Maximize Expected Accuracy#715689
- A Dynamic Theory of Random Price Discounts#1000661
- Probabilistic expectation and rationality in classical probability theory#477115
Record · ID 1149441
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