Linear combinations of computations

[dmm]

I know two classes of computations which admit taking linear combinations of execution runs:

• Probabilistic sampling (for linear combinations with positive coefficients; one should allow negative probabilities/negative sampling channel in order to allow negative coefficients);


• Generalized animation (the set of pixels does not have to form a discretized rectangle, but can generally admit any secondary structure over pixels).

Classes of computations which admit taking linear combinations of execution runs are of particular interest in connection with better schemes for program learning.