Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
From MaRDI portal
Publication:4102638
DOI10.1109/TIT.1973.1055082zbMath0335.62057OpenAlexW2117951639MaRDI QIDQ4102638
Bruno O. Shubert, Calvin M. Anderson
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1973.1055082
Related Items
An unpredictability approach to finite-state randomness, The apparent conflict between estimation and control - a survey of the two-armed bandit problem