Main Article Content
The first stage of any creative activity consists in generating a set of hypotheses and testing them. Generally, the time, required for testing a hypothesis is random and depends on its complexity (the prior probability of testing per unit time) and on acquired experience, determined by the set of hypotheses, successfully tested before. The problem is to choose an optimal schedule of testing, i.e. minimizing the sum of expected testing times, which are essentially nonlinear past-sequence-dependent and take into account learning and deterioration effects. For this aim, the general model of creative activity is formulated and the corresponding problem of optimal scheduling is stated; the classification of subproblems is introduced. Analysis of related works demonstrates the absence of methods to find computationally “simple” solution of the problem in hand. The used method of analytical proof of certain monotonic schedule optimality consists in reordering of two adjacent hypothesis, violating monotonicity. Main result is a set (for different subproblems) of sufficient conditions, under which the monotonic “simple-to-complex” schedule is optimal: the hypotheses are arranged in ascending order of their complexity.