Entropy with Limited Computation Resources

We consider information in presence of computation limitations. Specifically, we consider the following question. What is the output entropy of a computation if no (or limited) computation resources are available. We first explain two notions of effective input information and the average number of decisions in a computation problem and show how these notions can helps us understand the output entropy of a computation when computation resources are limited. Then we propose a procedure to evaluate output entropy in such scenarios and show that it satisfies some nice properties.