Some remarks on the finite-memory K-hypotheses problems
By: by Bruno O. Shubert
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1974
Place of publication: Monterey, Calif
Language: eng
Number of pages: 25
Subjects: Probabilities; Mathematical statistics; Markov processes
Description: Finite-memory statistical problems typically deal with the situation where the class of statistics is restricted to those taking on a fixed finite number of values.  Although a potentially infinite number of samples may be available the statistician is allowed to base his inference only on the current value of such a statistic -- the current state of his finite memory.  This is the case for instance when the inference is to be performed by a small size computer.  During the past several years a number of results have been obtained concerning a two-hypotheses finite-memory problem.  In this report we consider some aspects of the case where the number of hypotheses is greater than two.  In particular we derive a bound on the error probability for the 3-hypothesis case, present a counterexample to a recently proposed conjecture and briefly discuss a finite-memory version of the minimax theorem.  We also include two appendices containing some results on finite Markov chains.  (Author)
Notes: Title from cover.

"Prepared for: Chief of Naval Research, Arlington, Virginia 22217"--Cover.

"October 1974"--Cover.

"NPS-55Sy74101"--Cover.

Author(s) subject terms: Finite memory, Markov chains.

Includes bibliographical references (p. 25).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1974.