Such a variable criterion in stimulus identification can be realized with counting models (Townsend & Ashby,
1983), which have recently been applied in the context of TVA by Kyllingsbæk, Markussen, and Bundesen (
2012). Instead of relying on single categorizations, which occur with a certain hazard rate, these models count tentative categorizations, each of which is made at a constant Poisson rate. Each response category is associated with such a counter. In the model used by Kyllingsbæk et al., the categorization with the highest count of tentative categorizations is selected and reported at the end of processing. Here we instead assume that a certain threshold of tentative categorizations exists that must be passed to select and report a certain categorization, reflecting the variable decision criterion. There are independent counters for letter identification and TOJ operating at different thresholds. Mathematically, the processing time of a categorization is then described by the Erlang distribution (convolution of
k Poisson processes) with a mean of
k/
v, where
k is the number of tentative categorizations required to pass the threshold and make that categorization, and
v is the processing rate associated with the categorization or judgment. Hence, the expected encoding time in VSTM is given by
Ex =
t0 +
k/
vx and PE
TVA =
Euncued −
Ecued = (
t0-uncued +
k/
vuncued) − (
t0-cued +
k/
vcued). Further, we assume that in all three COA conditions only one tentative categorization is needed in order to make a letter categorization,
kLetter = 1, whereas the number of tentative categorizations needed in order to make a TOJ increases with the COA (i.e., the difficulty in making a TOJ). That is, we assume that only one tentative categorization is needed in the COA = 50 ms condition,
Display Formula
= 1, whereas two and four are needed in the COA = 100 ms condition,
Display Formula
= 2, and COA = 200 ms condition,
Display Formula
= 4, respectively (see
Figure 11).