How complex could the solution be to an initial value problem given by a polynomial-time computable function? This question can be given a natural and precise sense in computational complexity theory. In this note, we put together several results stating that more conditions on the problem make the solution simpler. In particular, Lipschitz continuity alone may leave the solution polynomial-spa...