A continuous probability space implies P!=NP

A proof that a computational problem exists (defined by a continuous sample space) whose solution can be verified in time polynomial in the number of bits of the input but which cannot be solved in time polynomial in the number of bits of the input.