This paper demonstrates a duality between the non-robustness of polynomial time dimension and the existence of one-way functions. Polynomial-time dimension (denoted \mathrm{cdim}_\mathrm{P}) quantifies the density of information of infinite sequences using polynomial time betting algorithms called s-gales. An alternate quantification of the notion of polynomial time density of information is ... more >>>