Concrete bounding of computation time frequently produces complexity classes contingent upon what? [SEP] But bounding the computation time above by some concrete function f(n) often yields complexity classes that depend on the chosen machine model.