The term you're looking for is counterfactual computation [1]: > We show that "interaction-free" measurements can be regarded as counterfactual computations,

The term you're looking for is counterfactual computation [1]: > We show that "interaction-free" measurements can be regarded as counterfactual computations, and our results then imply that N [the number of times that the computer is not run] must be large if the probability of interaction is to be close to zero. Finally, we consider some ways in which our formulation of counterfactual computation can be generalised. 1: http://arxiv.org/abs/quant-ph/9907007 http://arxiv.org/abs/quant-ph/9907007