Psychometrika

, Volume 29, Issue 4, pp 309–333

Markovian processes with identifiable states: General considerations and application to all-or-none learning

  • James G. Greeno
  • Theodore E. Steiner
Article

DOI: 10.1007/BF02289599

Cite this article as:
Greeno, J.G. & Steiner, T.E. Psychometrika (1964) 29: 309. doi:10.1007/BF02289599

Abstract

It often happens that a theory specifies some variables or states which cannot be identified completely in an experiment. When this happens, there are important questions as to whether the experiment is relevant to certain assumptions of the theory. Some of these questions are taken up in the present article, where a method is developed for describing the implications of a theory for an experiment. The method consists of constructing a second theory with all of its states identifiable in the outcome-space of the experiment. The method can be applied (i.e., an equivalent identifiable theory exists) whenever a theory specifies a probability function on the sample-space of possible outcomes of the experiment. An interesting relationship between lumpability of states and recurrent events plays an important role in the development of the identifiable theory. An identifiable theory of an experiment can be used to investigate relationships among different theories of the experiment. As an example, an identifiable theory of all-or-none learning is developed, and it is shown that a large class of all-or-none theories are equivalent for experiments in which a task is learned to a strict criterion.

Copyright information

© Psychometric Society 1964

Authors and Affiliations

  • James G. Greeno
    • 1
  • Theodore E. Steiner
    • 1
  1. 1.Indiana UniversityUSA

Personalised recommendations