AN EXTENSION OF SYSTEMS FACTORIAL TECHNOLOGY (SFT) TO ARBITRARY NUMBERS OF SUB-PROCESSES
The present study began by exploring the precise behavior of the serial exhaustive Survivor Interaction Contrast (SIC) function for n=2. We found that: A. there must be an odd number of crossings for any distributions. B. a rather mild condition known as log-concave, is sufficient as a guarantor of a single zero crossing. The second major part of the study explored how the SIC signatures act when the number of sub-processes (n) is varied: We provide a generalization of the SIC function to arbitrary number of sub-processes, as well as a theoretical analysis of the SIC in its generalized form for both parallel and serial models in conjunction with both the minimum time and maximum time stopping rules. Based on rigorous proofs, we show that even in the multi-processes case, SFT is a valid tool in distinguishing mental architectures.