The complexity of computation of two parameters of interest is discussed. One of these parameters is the number N1 of strings of any given length m derivable from an inferred grammers1G. The other parameter is the number N2 of strings derivable from G in derivations having n steps, where n is given. Both are likely to arise from any free or extensive use of an Interactive Heuristic Program.