Complete necessary-and-sufficient characterization of subsets of Q that admit computable finite-error sequential membership tests, extended to effectively presented countable families of real means.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computability Limits of Sequential Hypothesis Testing
Complete necessary-and-sufficient characterization of subsets of Q that admit computable finite-error sequential membership tests, extended to effectively presented countable families of real means.