> 2^n If it only computes from an expression to an expression. I think the bound might be higher if you use imperative statements (/effects). You can fill th

> 2^n If it only computes from an expression to an expression. I think the bound might be higher if you use imperative statements (/effects). You can fill the whole 2^n output space by calling random(). But in addition to that, the program might also delete an arbitrary file, or deadlock, etc.