We show that, for any function f in which Kleene's O is computable, the ordering of Turning degrees (i.e., degrees of difficulty of computation of functions) is not isomorphic to the ordering of degrees of functions from which f is computable. This refutes a well-known conjecture of H. Rogers, Jr., and others.